1 option
Developments in Language Theory : 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings / edited by Oscar H. Ibarra, Zhe Dang.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4036.
- Theoretical Computer Science and General Issues ; 4036
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Computers.
- Computer logic.
- Computer science--Mathematics.
- Computer science.
- Mathematical Logic and Formal Languages.
- Computation by Abstract Devices.
- Logics and Meanings of Programs.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Mathematical Logic and Formal Languages.
- Computation by Abstract Devices.
- Logics and Meanings of Programs.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (XII, 456 pages).
- Edition:
- First edition 2006.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-35430-7
- 9783540354307
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.