↓ Skip to main content

Descriptional Complexity of Formal Systems

Overview of attention for book
Cover of 'Descriptional Complexity of Formal Systems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Unambiguity in Automata Theory
  3. Altmetric Badge
    Chapter 2 Partial Derivative Automaton for Regular Expressions with Shuffle
  4. Altmetric Badge
    Chapter 3 Upper Bound on Syntactic Complexity of Suffix-Free Languages
  5. Altmetric Badge
    Chapter 4 Nondeterministic Tree Width of Regular Languages
  6. Altmetric Badge
    Chapter 5 Integer Complexity: Experimental and Analytical Results II
  7. Altmetric Badge
    Chapter 6 Square on Ideal, Closed and Free Languages
  8. Altmetric Badge
    Chapter 7 A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]
  9. Altmetric Badge
    Chapter 8 Compressibility of Finite Languages by Grammars
  10. Altmetric Badge
    Chapter 9 On the Complexity and Decidability of Some Problems Involving Shuffle
  11. Altmetric Badge
    Chapter 10 On the Computational Complexity of Problems Related to Distinguishability Sets
  12. Altmetric Badge
    Chapter 11 Prefix-Free Subsets of Regular Languages and Descriptional Complexity
  13. Altmetric Badge
    Chapter 12 Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
  14. Altmetric Badge
    Chapter 13 On Simulation Cost of Unary Limited Automata
  15. Altmetric Badge
    Chapter 14 On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
  16. Altmetric Badge
    Chapter 15 Quantum Queries on Permutations
  17. Altmetric Badge
    Chapter 16 Complement on Free and Ideal Languages
  18. Altmetric Badge
    Chapter 17 Universal Disjunctive Concatenation and Star
  19. Altmetric Badge
    Chapter 18 Quasi-Distances and Weighted Finite Automata
  20. Altmetric Badge
    Chapter 19 The State Complexity of Permutations on Finite Languages over Binary Alphabets
  21. Altmetric Badge
    Chapter 20 Star-Complement-Star on Prefix-Free Languages
  22. Altmetric Badge
    Chapter 21 Groups Whose Word Problem is a Petri Net Language
  23. Altmetric Badge
    Chapter 22 Regular Realizability Problems and Context-Free Languages
  24. Altmetric Badge
    Chapter 23 Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
  25. Altmetric Badge
    Chapter 24 Quantum State Complexity of Formal Languages
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

peer_reviews
1 peer review site
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
2 Dimensions
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
Descriptional Complexity of Formal Systems
Published by
Springer International Publishing, June 2015
DOI 10.1007/978-3-319-19225-3
ISBNs
978-3-31-919224-6, 978-3-31-919225-3
Editors

Shallit, Jeffrey, Okhotin, Alexander