↓ 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 Finite Automata and Randomness
  3. Altmetric Badge
    Chapter 2 Properties of Right One-Way Jumping Finite Automata
  4. Altmetric Badge
    Chapter 3 Word Problem Languages for Free Inverse Monoids
  5. Altmetric Badge
    Chapter 4 Most Complex Deterministic Union-Free Regular Languages
  6. Altmetric Badge
    Chapter 5 Site-Directed Insertion: Decision Problems, Maximality and Minimality
  7. Altmetric Badge
    Chapter 6 Two-Way Automata over Locally Finite Semirings
  8. Altmetric Badge
    Chapter 7 A New Technique for Reachability of States in Concatenation Automata
  9. Altmetric Badge
    Chapter 8 Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs
  10. Altmetric Badge
    Chapter 9 On the Generation of 2-Polyominoes
  11. Altmetric Badge
    Chapter 10 A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models
  12. Altmetric Badge
    Chapter 11 Linear-Time Limited Automata
  13. Altmetric Badge
    Chapter 12 Cover Complexity of Finite Languages
  14. Altmetric Badge
    Chapter 13 On the Grammatical Complexity of Finite Languages
  15. Altmetric Badge
    Chapter 14 State Grammars with Stores
  16. Altmetric Badge
    Chapter 15 Error-Free Affine, Unitary, and Probabilistic OBDDs
  17. Altmetric Badge
    Chapter 16 State Complexity of Unambiguous Operations on Deterministic Finite Automata
  18. Altmetric Badge
    Chapter 17 Cycle Height of Finite Automata
  19. Altmetric Badge
    Chapter 18 Finite Automata with Undirected State Graphs
  20. Altmetric Badge
    Chapter 19 Further Closure Properties of Input-Driven Pushdown Automata
  21. Altmetric Badge
    Chapter 20 State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis
Attention for Chapter 11: Linear-Time Limited Automata
Altmetric Badge

Readers on

mendeley
1 Mendeley
Summary
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
Linear-Time Limited Automata
Chapter number 11
Book title
Descriptional Complexity of Formal Systems
Published by
Springer, Cham, July 2018
DOI 10.1007/978-3-319-94631-3_11
Book ISBNs
978-3-31-994630-6, 978-3-31-994631-3
Authors

Bruno Guillon, Luca Prigioniero, Guillon, Bruno, Prigioniero, Luca

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%

This page is provided by Altmetric.