Languages Alive

Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday

Editors:

ISBN: 978-3-642-31643-2 (Print) 978-3-642-31644-9 (Online)

Table of contents (19 chapters)

  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-29

    Peptide Computers

  3. No Access

    Book Chapter

    Pages 30-43

    On the Power of Randomness versus Advice in Online Computation

  4. No Access

    Book Chapter

    Pages 44-55

    Relevance of Entities in Reaction Systems

  5. No Access

    Book Chapter

    Pages 56-74

    Generalized Random Context Picture Grammars: The State of the Art

  6. No Access

    Book Chapter

    Pages 75-85

    Cooperating Distributed Tree Automata

  7. No Access

    Book Chapter

    Pages 86-98

    A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems

  8. No Access

    Book Chapter

    Pages 99-110

    Equations in the Partial Semigroup of Words with Overlapping Products

  9. No Access

    Book Chapter

    Pages 111-137

    On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata

  10. No Access

    Book Chapter

    Pages 138-144

    The Boolean Formula Value Problem as Formal Language

  11. No Access

    Book Chapter

    Pages 145-159

    Hairpin Lengthening and Shortening of Regular Languages

  12. No Access

    Book Chapter

    Pages 160-173

    One-Sided Random Context Grammars with Leftmost Derivations

  13. No Access

    Book Chapter

    Pages 174-185

    Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars

  14. No Access

    Book Chapter

    Pages 186-206

    Descriptional Complexity of Input-Driven Pushdown Automata

  15. No Access

    Book Chapter

    Pages 207-220

    Towards “Fypercomputations” (in Membrane Computing)

  16. No Access

    Book Chapter

    Pages 221-235

    Undecidability of State Complexities Using Mirror Images

  17. No Access

    Book Chapter

    Pages 236-245

    Asymptotic Subword Complexity

  18. No Access

    Book Chapter

    Pages 246-264

    On Grammars Controlled by Parikh Vectors

  19. No Access

    Book Chapter

    Pages 265-272

    On the Nonterminal Complexity of Tree Controlled Grammars

  20. No Access

    Book Chapter

    Pages 273-290

    One-Way Finite Automata with Quantum and Classical States

  21. Back Matter

    Pages -