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

Descriptional Complexity of Formal Systems

Overview of attention for book
Descriptional Complexity of Formal Systems
Springer Nature Switzerland

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Operational State Complexity Revisited: The Contribution of Monsters and Modifiers
  3. Altmetric Badge
    Chapter 2 Hypercubes and Isometric Words Based on Swap and Mismatch Distance
  4. Altmetric Badge
    Chapter 3 Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle
  5. Altmetric Badge
    Chapter 4 Existential and Universal Width of Alternating Finite Automata
  6. Altmetric Badge
    Chapter 5 On Jaffe’s Pumping Lemma, Revisited
  7. Altmetric Badge
    Chapter 6 Operational Complexity: NFA-to-DFA Trade-Off
  8. Altmetric Badge
    Chapter 7 The Word Problem for Finitary Automaton Groups
  9. Altmetric Badge
    Chapter 8 Separating Words Problem over Groups
  10. Altmetric Badge
    Chapter 9 Complexity of Exclusive Nondeterministic Finite Automata
  11. Altmetric Badge
    Chapter 10 Shortest Accepted Strings for Two-Way Finite Automata: Approaching the  $$2^n$$ 2 n Lower Bound
  12. Altmetric Badge
    Chapter 11 Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage
  13. Altmetric Badge
    Chapter 12 Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter
  14. Altmetric Badge
    Chapter 13 Merging Two Hierarchies of External Contextual Grammars with Subregular Selection
  15. Altmetric Badge
    Chapter 14 A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words
Attention for Chapter 7: The Word Problem for Finitary Automaton Groups
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
1 Mendeley
Summary X

This page is provided by Altmetric.