↓ Skip to main content

Developments in Language Theory

Overview of attention for book
Cover of 'Developments in Language Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Computer Aided Synthesis: A Game-Theoretic Approach
  3. Altmetric Badge
    Chapter 2 A Comprehensive Introduction to the Theory of Word-Representable Graphs
  4. Altmetric Badge
    Chapter 3 Binomial Coefficients, Valuations, and Words
  5. Altmetric Badge
    Chapter 4 Connecting Decidability and Complexity for MSO Logic
  6. Altmetric Badge
    Chapter 5 On Regular Expression Proof Complexity
  7. Altmetric Badge
    Chapter 6 Operational State Complexity and Decidability of Jumping Finite Automata
  8. Altmetric Badge
    Chapter 7 Equivalence of Symbolic Tree Transducers
  9. Altmetric Badge
    Chapter 8 DFAs and PFAs with Long Shortest Synchronizing Word Length
  10. Altmetric Badge
    Chapter 9 On the Mother of All Automata: The Position Automaton
  11. Altmetric Badge
    Chapter 10 Two-Way Two-Tape Automata
  12. Altmetric Badge
    Chapter 11 Undecidability and Finite Automata
  13. Altmetric Badge
    Chapter 12 On the Power of Permitting Semi-conditional Grammars
  14. Altmetric Badge
    Chapter 13 On the Interplay Between Babai and Černý’s Conjectures
  15. Altmetric Badge
    Chapter 14 Differences Between 2D Neighborhoods According to Real Time Computation
  16. Altmetric Badge
    Chapter 15 A Medvedev Characterization of Recognizable Tree Series
  17. Altmetric Badge
    Chapter 16 On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$
  18. Altmetric Badge
    Chapter 17 Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
  19. Altmetric Badge
    Chapter 18 The Generalized Rank of Trace Languages
  20. Altmetric Badge
    Chapter 19 Two-Variable First Order Logic with Counting Quantifiers: Complexity Results
  21. Altmetric Badge
    Chapter 20 Deleting Deterministic Restarting Automata with Two Windows
  22. Altmetric Badge
    Chapter 21 Relative Prefix Distance Between Languages
  23. Altmetric Badge
    Chapter 22 On the Tree of Binary Cube-Free Words
  24. Altmetric Badge
    Chapter 23 Limited Automata and Unary Languages
  25. Altmetric Badge
    Chapter 24 A Characterization of Infinite LSP Words
  26. Altmetric Badge
    Chapter 25 On Computational Complexity of Set Automata
  27. Altmetric Badge
    Chapter 26 On the Number of Rich Words
  28. Altmetric Badge
    Chapter 27 One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity
  29. Altmetric Badge
    Chapter 28 Classifying Non-periodic Sequences by Permutation Transducers
Attention for Chapter 23: Limited Automata and Unary Languages
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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.
Chapter title
Limited Automata and Unary Languages
Chapter number 23
Book title
Developments in Language Theory
Published by
Springer, Cham, August 2017
DOI 10.1007/978-3-319-62809-7_23
Book ISBNs
978-3-31-962808-0, 978-3-31-962809-7
Authors

Giovanni Pighizzini, Luca Prigioniero

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Student > Master 1 50%
Readers by discipline Count As %
Computer Science 2 100%