↓ Skip to main content

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 Computing with Capsules
  3. Altmetric Badge
    Chapter 2 Minicomplexity
  4. Altmetric Badge
    Chapter 3 Logical Analysis of Hybrid Systems
  5. Altmetric Badge
    Chapter 4 Groups and Automata: A Perfect Match
  6. Altmetric Badge
    Chapter 5 Uniform Distributed Pushdown Automata Systems
  7. Altmetric Badge
    Chapter 6 Removing Nondeterminism in Constant Height Pushdown Automata
  8. Altmetric Badge
    Chapter 7 On Inverse Operations and Their Descriptional Complexity
  9. Altmetric Badge
    Chapter 8 Deciding Representability of Sets of Words of Equal Length
  10. Altmetric Badge
    Chapter 9 Syntactic Complexities of Some Classes of Star-Free Languages
  11. Altmetric Badge
    Chapter 10 Randomness Behaviour in Blum Universal Static Complexity Spaces
  12. Altmetric Badge
    Chapter 11 Production Complexity of Some Operations on Context-Free Languages
  13. Altmetric Badge
    Chapter 12 State Complexity of Star and Square of Union of k Regular Languages
  14. Altmetric Badge
    Chapter 13 State Complexity of Chop Operations on Unary and Finite Languages
  15. Altmetric Badge
    Chapter 14 On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars
  16. Altmetric Badge
    Chapter 15 Descriptional Complexity of Biautomata
  17. Altmetric Badge
    Chapter 16 Descriptional Complexity of Pushdown Store Languages
  18. Altmetric Badge
    Chapter 17 On Internal Contextual Grammars with Subregular Selection Languages
  19. Altmetric Badge
    Chapter 18 An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets
  20. Altmetric Badge
    Chapter 19 Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata
  21. Altmetric Badge
    Chapter 20 State Complexity and Limited Nondeterminism
  22. Altmetric Badge
    Chapter 21 Bounded Counter Languages
  23. Altmetric Badge
    Chapter 22 State Complexity of Projection and Quotient on Unranked Trees
  24. Altmetric Badge
    Chapter 23 Iterating Invertible Binary Transducers
  25. Altmetric Badge
    Chapter 24 Minimal DFA for Symmetric Difference NFA
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

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.
Title
Descriptional Complexity of Formal Systems
Published by
Springer Berlin Heidelberg, July 2012
DOI 10.1007/978-3-642-31623-4
ISBNs
978-3-64-231622-7, 978-3-64-231623-4
Editors

Kutrib, Martin, Moreira, Nelma, Reis, Rogério

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
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 %
Portugal 1 50%
Unknown 1 50%

Demographic breakdown

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