Language and Automata Theory and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Green’s Relations and Their Use in Automata Theory
3. Altmetric Badge
   Chapter 2 Automatic Structures and Groups
4. Altmetric Badge
   Chapter 3 Vector Addition System Reachability Problem: A Short Self-contained Proof
5. Altmetric Badge
   Chapter 4 Abstract Numeration Systems
6. Altmetric Badge
   Chapter 5 Rule Formats for Distributivity
7. Altmetric Badge
   Chapter 6 Mutation Systems
8. Altmetric Badge
   Chapter 7 Classification of String Languages via Tiling Recognizable Picture Languages
9. Altmetric Badge
   Chapter 8 A Simple and Efficient Universal Reversible Turing Machine
10. Altmetric Badge
    Chapter 9 The Parameterized Complexity of Chosen Problems for Finite Automata on Trees
11. Altmetric Badge
    Chapter 10 Recognizing Shuffled Languages
12. Altmetric Badge
    Chapter 11 Unary Pattern Avoidance in Partial Words Dense with Holes
13. Altmetric Badge
    Chapter 12 Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars
14. Altmetric Badge
    Chapter 13 Partial Derivatives of an Extended Regular Expression
15. Altmetric Badge
    Chapter 14 Automatic Learning of Subclasses of Pattern Languages
16. Altmetric Badge
    Chapter 15 Finite Orbits of Language Operations
17. Altmetric Badge
    Chapter 16 Language and Automata Theory and Applications
18. Altmetric Badge
    Chapter 17 Language and Automata Theory and Applications
19. Altmetric Badge
    Chapter 18 Improved Alignment Based Algorithm for Multilingual Text Compression
20. Altmetric Badge
    Chapter 19 Singular Artin Monoids of Finite Coxeter Type Are Automatic
21. Altmetric Badge
    Chapter 20 Networks of Evolutionary Processors with Subregular Filters
22. Altmetric Badge
    Chapter 21 Decision Problems for Interval Markov Chains
23. Altmetric Badge
    Chapter 22 Classifying Regular Languages via Cascade Products of Automata
24. Altmetric Badge
    Chapter 23 The Block Structure of Successor Morphisms
25. Altmetric Badge
    Chapter 24 Models for Quantitative Distributed Systems and Multi-Valued Logics
26. Altmetric Badge
    Chapter 25 A Local Greibach Normal Form for Hyperedge Replacement Grammars
27. Altmetric Badge
    Chapter 26 Unique Small Subgraphs Are Not Easier to Find
28. Altmetric Badge
    Chapter 27 Simplifying DPDA Using Supplementary Information
29. Altmetric Badge
    Chapter 28 Normalization of Sequential Top-Down Tree-to-Word Transducers
30. Altmetric Badge
    Chapter 29 Planarity of Knots, Register Automata and LogSpace Computability
31. Altmetric Badge
    Chapter 30 Tarski’s Principle, Categorial Grammars and Learnability
32. Altmetric Badge
    Chapter 31 Globally Deterministic CD-Systems of Stateless R(1)-Automata
33. Altmetric Badge
    Chapter 32 Bit-coded Regular Expression Parsing
34. Altmetric Badge
    Chapter 33 Descriptional Complexity of Unambiguous Nested Word Automata
35. Altmetric Badge
    Chapter 34 Avalanche Structure in the Kadanoff Sand Pile Model
36. Altmetric Badge
    Chapter 35 Well-Quasi-Ordering Hereditarily Finite Sets
37. Altmetric Badge
    Chapter 36 On the Interval-Bound Problem for Weighted Timed Automata
38. Altmetric Badge
    Chapter 37 Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access
39. Altmetric Badge
    Chapter 38 Syntactic Complexity of Ultimately Periodic Sets of Integers
40. Altmetric Badge
    Chapter 39 Undecidability of the State Complexity of Composed Regular Operations
41. Altmetric Badge
    Chapter 40 Restarting Automata with Auxiliary Symbols and Small Lookahead