↓ 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 Recent Developments in Quantum Algorithms and Complexity
  3. Altmetric Badge
    Chapter 2 Automata with Reversal-Bounded Counters: A Survey
  4. Altmetric Badge
    Chapter 3 Star-Free Languages and Local Divisors
  5. Altmetric Badge
    Chapter 4 Aperiodic Tilings by Right Triangles
  6. Altmetric Badge
    Chapter 5 Quantum Hashing via ε -Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas
  7. Altmetric Badge
    Chapter 6 Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
  8. Altmetric Badge
    Chapter 7 Matter and Anti-Matter in Membrane Systems
  9. Altmetric Badge
    Chapter 8 Complexity of Extended vs. Classic LR Parsers
  10. Altmetric Badge
    Chapter 9 Most Complex Regular Right-Ideal Languages
  11. Altmetric Badge
    Chapter 10 State Complexity of Inversion Operations
  12. Altmetric Badge
    Chapter 11 Cycles and Global Attractors of Reaction Systems
  13. Altmetric Badge
    Chapter 12 Classical Automata on Promise Problems
  14. Altmetric Badge
    Chapter 13 From Ultrafilters on Words to the Expressive Power of a Fragment of Logic
  15. Altmetric Badge
    Chapter 14 Computation Width and Deviation Number
  16. Altmetric Badge
    Chapter 15 Boundary Sets of Regular and Context-Free Languages
  17. Altmetric Badge
    Chapter 16 Biclique Coverings, Rectifier Networks and the Cost of ε -Removal
  18. Altmetric Badge
    Chapter 17 Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
  19. Altmetric Badge
    Chapter 18 A Full and Linear Index of a Tree for Tree Patterns
  20. Altmetric Badge
    Chapter 19 Prefix-Free Languages: Right Quotient and Reversal
  21. Altmetric Badge
    Chapter 20 Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
  22. Altmetric Badge
    Chapter 21 On the State Complexity of Closures and Interiors of Regular Languages with Subwords
  23. Altmetric Badge
    Chapter 22 State Complexity of Regular Tree Languages for Tree Pattern Matching
  24. Altmetric Badge
    Chapter 23 On the Complexity of L -reachability
  25. Altmetric Badge
    Chapter 24 Positive and Negative Proofs for Circuits and Branching Programs
  26. Altmetric Badge
    Chapter 25 Regularity and Size of Set Automata
  27. Altmetric Badge
    Chapter 26 Operational State Complexity under Parikh Equivalence
  28. Altmetric Badge
    Chapter 27 Complexity of Checking Whether Two Automata Are Synchronized by the Same Language
  29. Altmetric Badge
    Chapter 28 On the Descriptional Complexity of Deterministic Ordered Restarting Automata
  30. Altmetric Badge
    Chapter 29 State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
  31. Altmetric Badge
    Chapter 30 A Note on Pushdown Automata Systems
  32. Altmetric Badge
    Chapter 31 Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

Readers on

mendeley
3 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
Descriptional Complexity of Formal Systems
Published by
Springer International Publishing, July 2014
DOI 10.1007/978-3-319-09704-6
ISBNs
978-3-31-909703-9, 978-3-31-909704-6
Editors

Jürgensen, Helmut, Karhumäki, Juhani, Okhotin, Alexander

X Demographics

X Demographics

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

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 67%
Professor > Associate Professor 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Mathematics 1 33%