Developments in Language Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Adding Nesting Structure to Words
3. Altmetric Badge
   Chapter 2 Can Abstract State Machines Be Useful in Language Theory?
4. Altmetric Badge
   Chapter 3 Languages in Membrane Computing: Some Details for Spiking Neural P Systems
5. Altmetric Badge
   Chapter 4 Computational Nature of Biochemical Reactions
6. Altmetric Badge
   Chapter 5 Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
7. Altmetric Badge
   Chapter 6 Weighted Automata and Weighted Logics on Infinite Words
8. Altmetric Badge
   Chapter 7 Simulation Relations for Alternating Parity Automata and Parity Games
9. Altmetric Badge
   Chapter 8 Equivalence of Functions Represented by Simple Context-Free Grammars with Output
10. Altmetric Badge
    Chapter 9 On the Gap-Complexity of Simple RL-Automata
11. Altmetric Badge
    Chapter 10 Noncanonical LALR(1) Parsing
12. Altmetric Badge
    Chapter 11 Context-Free Grammars and XML Languages
13. Altmetric Badge
    Chapter 12 Synchronization of Pushdown Automata
14. Altmetric Badge
    Chapter 13 Context-Dependent Nondeterminism for Pushdown Automata
15. Altmetric Badge
    Chapter 14 Prime Decompositions of Regular Languages
16. Altmetric Badge
    Chapter 15 On Weakly Ambiguous Finite Transducers
17. Altmetric Badge
    Chapter 16 Ciliate Bio-operations on Finite String Multisets
18. Altmetric Badge
    Chapter 17 Characterizing DNA Bond Shapes Using Trajectories
19. Altmetric Badge
    Chapter 18 Involution Solid and Join Codes
20. Altmetric Badge
    Chapter 19 Well-Founded Semantics for Boolean Grammars
21. Altmetric Badge
    Chapter 20 Hierarchies of Tree Series Transformations Revisited
22. Altmetric Badge
    Chapter 21 Bag Context Tree Grammars 
23. Altmetric Badge
    Chapter 22 Closure of Language Classes Under Bounded Duplication
24. Altmetric Badge
    Chapter 23 The Boolean Closure of Growing Context-Sensitive Languages
25. Altmetric Badge
    Chapter 24 Well Quasi Orders and the Shuffle Closure of Finite Sets
26. Altmetric Badge
    Chapter 25 The Growth Ratio of Synchronous Rational Relations Is Unique
27. Altmetric Badge
    Chapter 26 On Critical Exponents in Fixed Points of Non-erasing Morphisms
28. Altmetric Badge
    Chapter 27 P Systems with Proteins on Membranes and Membrane Division
29. Altmetric Badge
    Chapter 28 Computing by Only Observing
30. Altmetric Badge
    Chapter 29 A Decision Procedure for Reflexive Regular Splicing Languages
31. Altmetric Badge
    Chapter 30 Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
32. Altmetric Badge
    Chapter 31 End-Marked Maximal Depth-First Contextual Grammars
33. Altmetric Badge
    Chapter 32 Some Examples of Semi-rational DAG Languages
34. Altmetric Badge
    Chapter 33 Finding Lower Bounds for Nondeterministic State Complexity Is Hard
35. Altmetric Badge
    Chapter 34 Lowering Undecidability Bounds for Decision Questions in Matrices
36. Altmetric Badge
    Chapter 35 Complexity of Degenerated Three Dimensional Billiard Words
37. Altmetric Badge
    Chapter 36 Factorial Languages of Low Combinatorial Complexity
38. Altmetric Badge
    Chapter 37 Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy
39. Altmetric Badge
    Chapter 38 Language Equations with Complementation
40. Altmetric Badge
    Chapter 39 Synchronizing Automata with a Letter of Deficiency 2
41. Altmetric Badge
    Chapter 40 On Some Variations of Two-Way Probabilistic Finite Automata Models