↓ Skip to main content

Language and Automata Theory and Applications

Overview of attention for book
Cover of 'Language and Automata Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Modern Aspects of Complexity Within Formal Languages
  3. Altmetric Badge
    Chapter 2 Observation and Interaction
  4. Altmetric Badge
    Chapter 3 From Words to Graphs, and Back
  5. Altmetric Badge
    Chapter 4 An Oracle Hierarchy for Small One-Way Finite Automata
  6. Altmetric Badge
    Chapter 5 Orbits of Abelian Automaton Groups
  7. Altmetric Badge
    Chapter 6 Bounded Automata Groups are co-ET0L
  8. Altmetric Badge
    Chapter 7 Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata
  9. Altmetric Badge
    Chapter 8 On Varieties of Ordered Automata
  10. Altmetric Badge
    Chapter 9 Automata over Infinite Sequences of Reals
  11. Altmetric Badge
    Chapter 10 Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
  12. Altmetric Badge
    Chapter 11 Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata
  13. Altmetric Badge
    Chapter 12 Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference
  14. Altmetric Badge
    Chapter 13 Closure and Nonclosure Properties of the Compressible and Rankable Sets
  15. Altmetric Badge
    Chapter 14 The Range of State Complexities of Languages Resulting from the Cut Operation
  16. Altmetric Badge
    Chapter 15 State Complexity of Pseudocatenation
  17. Altmetric Badge
    Chapter 16 Complexity of Regex Crosswords
  18. Altmetric Badge
    Chapter 17 Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars
  19. Altmetric Badge
    Chapter 18 Transformation of Petri Nets into Context-Dependent Fusion Grammars
  20. Altmetric Badge
    Chapter 19 Generalized Register Context-Free Grammars
  21. Altmetric Badge
    Chapter 20 Logic and Rational Languages of Scattered and Countable Series-Parallel Posets
  22. Altmetric Badge
    Chapter 21 Toroidal Codes and Conjugate Pictures
  23. Altmetric Badge
    Chapter 22 Geometrical Closure of Binary $$V_{3/2}$$ Languages
  24. Altmetric Badge
    Chapter 23 Deterministic Biautomata and Subclasses of Deterministic Linear Languages
  25. Altmetric Badge
    Chapter 24 Learning Unions of k -Testable Languages
  26. Altmetric Badge
    Chapter 25 Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables
  27. Altmetric Badge
    Chapter 26 Rule-Based Unification in Combined Theories and the Finite Variant Property
  28. Altmetric Badge
    Chapter 27 Extensions of the Caucal Hierarchy?
  29. Altmetric Badge
    Chapter 28 Tight Bounds on the Minimum Size of a Dynamic Monopoly
  30. Altmetric Badge
    Chapter 29 Recurrence in Multidimensional Words
  31. Altmetric Badge
    Chapter 30 A Note with Computer Exploration on the Triangle Conjecture
  32. Altmetric Badge
    Chapter 31 Efficient Representation and Counting of Antipower Factors in Words
  33. Altmetric Badge
    Chapter 32 On the Maximum Number of Distinct Palindromic Sub-arrays
  34. Altmetric Badge
    Chapter 33 Syntactic View of Sigma-Tau Generation of Permutations
  35. Altmetric Badge
    Chapter 34 Palindromic Subsequences in Finite Words
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users
wikipedia
1 Wikipedia page

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Language and Automata Theory and Applications
Published by
Springer International Publishing, April 2019
DOI 10.1007/978-3-030-13435-8
ISBNs
978-3-03-013434-1, 978-3-03-013435-8
Editors

Martín-Vide, Carlos, Okhotin, Alexander, Shapira, Dana

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.