↓ Skip to main content
What is this page? Embed badge

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 A General Framework for Sequential Grammars with Control Mechanisms
  3. Altmetric Badge
    Chapter 2 Low-Complexity Tilings of the Plane
  4. Altmetric Badge
    Chapter 3 Union-Freeness, Deterministic Union-Freeness and Union-Complexity
  5. Altmetric Badge
    Chapter 4 Limited Automata: Properties, Complexity and Variants
  6. Altmetric Badge
    Chapter 5 Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)
  7. Altmetric Badge
    Chapter 6 State Complexity of Single-Word Pattern Matching in Regular Languages
  8. Altmetric Badge
    Chapter 7 Square, Power, Positive Closure, and Complementation on Star-Free Languages
  9. Altmetric Badge
    Chapter 8 Descriptional Complexity of Matrix Simple Semi-conditional Grammars
  10. Altmetric Badge
    Chapter 9 Regulated Tree Automata
  11. Altmetric Badge
    Chapter 10 Generalized de Bruijn Words and the State Complexity of Conjugate Sets
  12. Altmetric Badge
    Chapter 11 The Syntactic Complexity of Semi-flower Languages
  13. Altmetric Badge
    Chapter 12 Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity
  14. Altmetric Badge
    Chapter 13 Computability on Quasi-Polish Spaces
  15. Altmetric Badge
    Chapter 14 NFA-to-DFA Trade-Off for Regular Operations
  16. Altmetric Badge
    Chapter 15 State Complexity of Simple Splicing
  17. Altmetric Badge
    Chapter 16 Nondeterminism Growth and State Complexity
  18. Altmetric Badge
    Chapter 17 Descriptional Complexity of Iterated Uniform Finite-State Transducers
  19. Altmetric Badge
    Chapter 18 On Classes of Regular Languages Related to Monotone WQOs
  20. Altmetric Badge
    Chapter 19 State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages
  21. Altmetric Badge
    Chapter 20 Pushdown Automata and Constant Height: Decidability and Bounds
  22. Altmetric Badge
    Chapter 21 On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances
  23. Altmetric Badge
    Chapter 22 How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
Summary News
So far, Altmetric has seen 2 news stories from 1 outlets.

This page shows the most recent news stories that mention this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.