↓ 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 Sensing as a Complexity Measure
  3. Altmetric Badge
    Chapter 2 Avoiding Overlaps in Pictures
  4. Altmetric Badge
    Chapter 3 Descriptional Complexity and Operations – Two Non-classical Cases
  5. Altmetric Badge
    Chapter 4 Applications of Transducers in Independent Languages, Word Distances, Codes
  6. Altmetric Badge
    Chapter 5 On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages
  7. Altmetric Badge
    Chapter 6 On the Average Complexity of Strong Star Normal Form
  8. Altmetric Badge
    Chapter 7 Most Complex Non-returning Regular Languages
  9. Altmetric Badge
    Chapter 8 Uncountable Realtime Probabilistic Classes
  10. Altmetric Badge
    Chapter 9 A Parametrized Analysis of Algorithms on Hierarchical Graphs
  11. Altmetric Badge
    Chapter 10 Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity
  12. Altmetric Badge
    Chapter 11 Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
  13. Altmetric Badge
    Chapter 12 Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete
  14. Altmetric Badge
    Chapter 13 Self-attraction Removal from Oritatami Systems
  15. Altmetric Badge
    Chapter 14 One-Time Nondeterministic Computations
  16. Altmetric Badge
    Chapter 15 Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages
  17. Altmetric Badge
    Chapter 16 Branching Measures and Nearly Acyclic NFAs
  18. Altmetric Badge
    Chapter 17 Square on Deterministic, Alternating, and Boolean Finite Automata
  19. Altmetric Badge
    Chapter 18 A Pumping Lemma for Ordered Restarting Automata
  20. Altmetric Badge
    Chapter 19 Concise Representations of Reversible Automata
  21. Altmetric Badge
    Chapter 20 State Complexity of Unary SV-XNFA with Different Acceptance Conditions
  22. Altmetric Badge
    Chapter 21 Reset Complexity of Ideal Languages Over a Binary Alphabet
  23. Altmetric Badge
    Chapter 22 2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets
  24. Altmetric Badge
    Chapter 23 State Complexity of Suffix Distance
  25. Altmetric Badge
    Chapter 24 The Quotient Operation on Input-Driven Pushdown Automata
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

q&a
1 Q&A thread

Readers on

mendeley
10 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, Cham, January 2017
DOI 10.1007/978-3-319-60252-3
ISBNs
978-3-31-960251-6, 978-3-31-960252-3
Editors

Giovanni Pighizzini, Cezar Câmpeanu

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 10 100%

Demographic breakdown

Readers by professional status Count As %
Professor 3 30%
Student > Master 3 30%
Student > Bachelor 1 10%
Student > Ph. D. Student 1 10%
Researcher 1 10%
Other 1 10%
Readers by discipline Count As %
Computer Science 4 40%
Unspecified 2 20%
Business, Management and Accounting 1 10%
Economics, Econometrics and Finance 1 10%
Social Sciences 1 10%
Other 1 10%