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
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
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
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Edizione: | 1st ed. 2006. |
| Descrizione fisica: | 1 online resource (XII, 456 p.) |
| Disciplina: | 005.13/1 |
| 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 | |
| Persona (resp. second.): | IbarraOscar H |
| DangZhe | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| 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. |
| Titolo autorizzato: | Developments in Language Theory |
| ISBN: | 3-540-35430-1 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465759603316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 4036