↓ 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 Blum Static Complexity and Encoding Spaces
  3. Altmetric Badge
    Chapter 2 Millstream Systems and Graph Transformation for Complex Linguistic Models
  4. Altmetric Badge
    Chapter 3 Can Chimps Go It Alone?
  5. Altmetric Badge
    Chapter 4 Invertible Transductions and Iteration
  6. Altmetric Badge
    Chapter 5 Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star
  7. Altmetric Badge
    Chapter 6 Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views
  8. Altmetric Badge
    Chapter 7 State Complexity of Basic Operations on Non-returning Regular Languages
  9. Altmetric Badge
    Chapter 8 State Complexity of Subtree-Free Regular Tree Languages
  10. Altmetric Badge
    Chapter 9 State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
  11. Altmetric Badge
    Chapter 10 A Direct Construction of Finite State Automata for Pushdown Store Languages
  12. Altmetric Badge
    Chapter 11 Nondeterministic State Complexity of Proportional Removals
  13. Altmetric Badge
    Chapter 12 Nondeterministic Biautomata and Their Descriptional Complexity
  14. Altmetric Badge
    Chapter 13 Queue Automata of Constant Length
  15. Altmetric Badge
    Chapter 14 On the State Complexity of the Reverse of \({\mathcal R}\) - and \({\mathcal J}\) -Trivial Regular Languages
  16. Altmetric Badge
    Chapter 15 Size of Unary One-Way Multi-head Finite Automata
  17. Altmetric Badge
    Chapter 16 Syntactic Complexity of \({\mathcal R}\) - and \({\mathcal J}\) -Trivial Regular Languages
  18. Altmetric Badge
    Chapter 17 Sophistication as Randomness Deficiency
  19. Altmetric Badge
    Chapter 18 Shortest Repetition-Free Words Accepted by Automata
  20. Altmetric Badge
    Chapter 19 A Characterisation of NL/poly via Nondeterministic Finite Automata
  21. Altmetric Badge
    Chapter 20 Improved Normal Form for Grammars with One-Sided Contexts
  22. Altmetric Badge
    Chapter 21 Comparisons between Measures of Nondeterminism on Finite Automata
  23. Altmetric Badge
    Chapter 22 Finite Nondeterminism vs. DFAs with Multiple Initial States
  24. Altmetric Badge
    Chapter 23 The Power of Centralized PC Systems of Pushdown Automata
  25. Altmetric Badge
    Chapter 24 Limited Automata and Regular Languages
  26. Altmetric Badge
    Chapter 25 Reversal on Regular Languages and Descriptional Complexity
  27. Altmetric Badge
    Chapter 26 Kleene Star on Unary Regular Languages
Attention for Chapter 10: A Direct Construction of Finite State Automata for Pushdown Store Languages
Altmetric Badge

Readers on

mendeley
2 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
A Direct Construction of Finite State Automata for Pushdown Store Languages
Chapter number 10
Book title
Descriptional Complexity of Formal Systems
Published by
Springer Berlin Heidelberg, July 2013
DOI 10.1007/978-3-642-39310-5_10
Book ISBNs
978-3-64-239309-9, 978-3-64-239310-5
Authors

Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano

Editors

Helmut Jurgensen, Rogério Reis

View on publisher site
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 > Ph. D. Student 1 50%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.