↓ 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 Completely Reachable Automata
  3. Altmetric Badge
    Chapter 2 Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
  4. Altmetric Badge
    Chapter 3 Self-Verifying Finite Automata and Descriptional Complexity
  5. Altmetric Badge
    Chapter 4 On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
  6. Altmetric Badge
    Chapter 5 Unrestricted State Complexity of Binary Operations on Regular Languages
  7. Altmetric Badge
    Chapter 6 On the State Complexity of the Shuffle of Regular Languages
  8. Altmetric Badge
    Chapter 7 MSO-definable Properties of Muller Context-Free Languages Are Decidable
  9. Altmetric Badge
    Chapter 8 Contextual Array Grammars with Matrix and Regular Control
  10. Altmetric Badge
    Chapter 9 Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
  11. Altmetric Badge
    Chapter 10 Operations on Weakly Recognizing Morphisms
  12. Altmetric Badge
    Chapter 11 Descriptional Complexity of Bounded Regular Languages
  13. Altmetric Badge
    Chapter 12 The Complexity of Languages Resulting from the Concatenation Operation
  14. Altmetric Badge
    Chapter 13 Minimal and Reduced Reversible Automata
  15. Altmetric Badge
    Chapter 14 Unary Self-verifying Symmetric Difference Automata
  16. Altmetric Badge
    Chapter 15 State Complexity of Prefix Distance of Subregular Languages
  17. Altmetric Badge
    Chapter 16 Two Results on Discontinuous Input Processing
Attention for Chapter 1: Completely Reachable Automata
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
4 Mendeley
Summary Dimensions citations
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
Completely Reachable Automata
Chapter number 1
Book title
Descriptional Complexity of Formal Systems
Published by
Springer, Cham, July 2016
DOI 10.1007/978-3-319-41114-9_1
Book ISBNs
978-3-31-941113-2, 978-3-31-941114-9
Authors

Eugenija A. Bondar, Mikhail V. Volkov

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 25%
Student > Master 1 25%
Unknown 2 50%
Readers by discipline Count As %
Medicine and Dentistry 1 25%
Engineering 1 25%
Unknown 2 50%

This page is provided by Altmetric.