Language and Automata Theory and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$
3. Altmetric Badge
   Chapter 2 Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data
4. Altmetric Badge
   Chapter 3 A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
5. Altmetric Badge
   Chapter 4 Efficient Learning of Tier-Based Strictly k -Local Languages
6. Altmetric Badge
   Chapter 5 The Strong, Weak, and Very Weak Finite Context and Kernel Properties
7. Altmetric Badge
   Chapter 6 $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$
8. Altmetric Badge
   Chapter 7 An Automata View to Goal-Directed Methods
9. Altmetric Badge
   Chapter 8 A Calculus of Cyber-Physical Systems
10. Altmetric Badge
    Chapter 9 Efficient Pattern Matching in Elastic-Degenerate Texts
11. Altmetric Badge
    Chapter 10 Integrated Encryption in Dynamic Arithmetic Compression
12. Altmetric Badge
    Chapter 11 Two-Dimensional Palindromes and Their Properties
13. Altmetric Badge
    Chapter 12 Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
14. Altmetric Badge
    Chapter 13 On the Complexity of Hard Enumeration Problems
15. Altmetric Badge
    Chapter 14 Consensus String Problem for Multiple Regular Languages
16. Altmetric Badge
    Chapter 15 The Weight in Enumeration
17. Altmetric Badge
    Chapter 16 Minimization of Finite State Automata Through Partition Aggregation
18. Altmetric Badge
    Chapter 17 Derivatives and Finite Automata of Expressions in Star Normal Form
19. Altmetric Badge
    Chapter 18 Finding DFAs with Maximal Shortest Synchronizing Word Length
20. Altmetric Badge
    Chapter 19 Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited
21. Altmetric Badge
    Chapter 20 Linear Parsing Expression Grammars
22. Altmetric Badge
    Chapter 21 On Finite-Index Indexed Grammars and Their Restrictions
23. Altmetric Badge
    Chapter 22 A Derivational Model of Discontinuous Parsing
24. Altmetric Badge
    Chapter 23 Cut Languages in Rational Bases
25. Altmetric Badge
    Chapter 24 Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly
26. Altmetric Badge
    Chapter 25 Partitioning Graphs into Induced Subgraphs
27. Altmetric Badge
    Chapter 26 Space Complexity of Reachability Testing in Labelled Graphs
28. Altmetric Badge
    Chapter 27 Most General Property-Preserving Updates
29. Altmetric Badge
    Chapter 28 Over Which Monoids is the Transducer Determinization Procedure Applicable?
30. Altmetric Badge
    Chapter 29 Color War: Cellular Automata with Majority-Rule
31. Altmetric Badge
    Chapter 30 On the Computational Power of Affine Automata
32. Altmetric Badge
    Chapter 31 Detecting Useless Transitions in Pushdown Automata
33. Altmetric Badge
    Chapter 32 Hardness Results for Coverability Problem of Well-Structured Pushdown Systems
34. Altmetric Badge
    Chapter 33 Reachability Analysis of Pushdown Systems with an Upper Stack