Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Developments in Language Theory [[electronic resource] ] : 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings / / edited by Oscar H. Ibarra, Zhe Dang
| Developments in Language Theory [[electronic resource] ] : 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings / / edited by Oscar H. Ibarra, Zhe Dang |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 456 p.) |
| Disciplina | 005.13/1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-540-35430-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Adding Nesting Structure to Words -- Can Abstract State Machines Be Useful in Language Theory? -- Languages in Membrane Computing: Some Details for Spiking Neural P Systems -- Computational Nature of Biochemical Reactions -- Papers -- Polynomials, Fragments of Temporal Logic and the Variety DA over Traces -- Weighted Automata and Weighted Logics on Infinite Words -- Simulation Relations for Alternating Parity Automata and Parity Games -- Equivalence of Functions Represented by Simple Context-Free Grammars with Output -- On the Gap-Complexity of Simple RL-Automata -- Noncanonical LALR(1) Parsing -- Context-Free Grammars and XML Languages -- Synchronization of Pushdown Automata -- Context-Dependent Nondeterminism for Pushdown Automata -- Prime Decompositions of Regular Languages -- On Weakly Ambiguous Finite Transducers -- Ciliate Bio-operations on Finite String Multisets -- Characterizing DNA Bond Shapes Using Trajectories -- Involution Solid and Join Codes -- Well-Founded Semantics for Boolean Grammars -- Hierarchies of Tree Series Transformations Revisited -- Bag Context Tree Grammars -- Closure of Language Classes Under Bounded Duplication -- The Boolean Closure of Growing Context-Sensitive Languages -- Well Quasi Orders and the Shuffle Closure of Finite Sets -- The Growth Ratio of Synchronous Rational Relations Is Unique -- On Critical Exponents in Fixed Points of Non-erasing Morphisms -- P Systems with Proteins on Membranes and Membrane Division -- Computing by Only Observing -- A Decision Procedure for Reflexive Regular Splicing Languages -- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages -- End-Marked Maximal Depth-First Contextual Grammars -- Some Examples of Semi-rational DAG Languages -- Finding Lower Bounds for Nondeterministic State Complexity Is Hard -- Lowering Undecidability Bounds for Decision Questions in Matrices -- Complexity of Degenerated Three Dimensional Billiard Words -- Factorial Languages of Low Combinatorial Complexity -- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy -- Language Equations with Complementation -- Synchronizing Automata with a Letter of Deficiency 2 -- On Some Variations of Two-Way Probabilistic Finite Automata Models. |
| Record Nr. | UNISA-996465759603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings / / edited by Oscar H. Ibarra, Zhe Dang
| Implementation and Application of Automata [[electronic resource] ] : 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings / / edited by Oscar H. Ibarra, Zhe Dang |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XI, 312 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Computer science Algorithms Computer logic Mathematical logic Artificial Intelligence Computation by Abstract Devices Computer Science, general Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN |
3-540-45089-0
1-4175-6477-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Automata for Specifying Component Interfaces -- Automata on Words -- Regular Papers -- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications -- Timing Parameter Characterization of Real-Time Systems -- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata -- From Regular Weighted Expressions to Finite Automata -- Bideterministic Automata and Minimal Representations of Regular Languages -- Succinct Descriptions of Regular Languages with Binary ?-NFAs -- An Efficient Pre-determinization Algorithm -- Introducing Vaucanson -- WFSC — A New Weighted Finite State Compiler -- Ternary Directed Acyclic Word Graphs -- Running Time Complexity of Printing an Acyclic Automaton -- Reducing the Time Complexity of Testing for Local Threshold Testability -- Branching Automata with Costs — A Way of Reflecting Parallelism in Costs -- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations -- TCTL Inevitability Analysis of Dense-Time Systems -- Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services -- Boolean Operations for Attribute-Element Constraints -- XML Schema Containment Checking Based on Semi-implicit Techniques -- Weak Minimization of DFA — An Algorithm and Applications -- Bag Automata and Stochastic Retrieval of Biomolecules in Solution -- An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics -- Robust Parsing Using Dynamic Programming -- LR Parsing for Global Index Languages (GILs) -- The Ehrenfeucht-Mycielski Sequence -- Poster Paper -- The Longest Common Subsequence Problem A Finite Automata Approach -- AVA: An Applet for Visualizing FRACTRAN and Other Automata -- Preliminary Experiments in Hardcoding Finite Automata -- Computational Linguistic Motivations for a Finite-State Machine Hierarchy -- The Effect of Rewriting Regular Expressions on Their Accepting Automata -- Building Context-Sensitive Parsers from CF Grammars with Regular Control Language -- Finite-State Molecular Computing. |
| Record Nr. | UNISA-996465964403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings / / edited by Oscar H. Ibarra, Zhe Dang
| Implementation and Application of Automata : 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings / / edited by Oscar H. Ibarra, Zhe Dang |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XI, 312 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Computer science Algorithms Computer logic Mathematical logic Artificial Intelligence Computation by Abstract Devices Computer Science, general Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN |
3-540-45089-0
1-4175-6477-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Automata for Specifying Component Interfaces -- Automata on Words -- Regular Papers -- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications -- Timing Parameter Characterization of Real-Time Systems -- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata -- From Regular Weighted Expressions to Finite Automata -- Bideterministic Automata and Minimal Representations of Regular Languages -- Succinct Descriptions of Regular Languages with Binary ?-NFAs -- An Efficient Pre-determinization Algorithm -- Introducing Vaucanson -- WFSC — A New Weighted Finite State Compiler -- Ternary Directed Acyclic Word Graphs -- Running Time Complexity of Printing an Acyclic Automaton -- Reducing the Time Complexity of Testing for Local Threshold Testability -- Branching Automata with Costs — A Way of Reflecting Parallelism in Costs -- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations -- TCTL Inevitability Analysis of Dense-Time Systems -- Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services -- Boolean Operations for Attribute-Element Constraints -- XML Schema Containment Checking Based on Semi-implicit Techniques -- Weak Minimization of DFA — An Algorithm and Applications -- Bag Automata and Stochastic Retrieval of Biomolecules in Solution -- An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics -- Robust Parsing Using Dynamic Programming -- LR Parsing for Global Index Languages (GILs) -- The Ehrenfeucht-Mycielski Sequence -- Poster Paper -- The Longest Common Subsequence Problem A Finite Automata Approach -- AVA: An Applet for Visualizing FRACTRAN and Other Automata -- Preliminary Experiments in Hardcoding Finite Automata -- Computational Linguistic Motivations for a Finite-State Machine Hierarchy -- The Effect of Rewriting Regular Expressions on Their Accepting Automata -- Building Context-Sensitive Parsers from CF Grammars with Regular Control Language -- Finite-State Molecular Computing. |
| Record Nr. | UNINA-9910144027103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||