245 followers
True State Complexity of Binary Operations on Regular Languages https://t.co/OHC3JPgFUa
Descriptional Complexity of Formal Systems
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Completely Reachable Automata
-
Altmetric BadgeChapter 2 Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
-
Altmetric BadgeChapter 3 Self-Verifying Finite Automata and Descriptional Complexity
-
Altmetric BadgeChapter 4 On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
-
Altmetric BadgeChapter 5 Unrestricted State Complexity of Binary Operations on Regular Languages
-
Altmetric BadgeChapter 6 On the State Complexity of the Shuffle of Regular Languages
-
Altmetric BadgeChapter 7 MSO-definable Properties of Muller Context-Free Languages Are Decidable
-
Altmetric BadgeChapter 8 Contextual Array Grammars with Matrix and Regular Control
-
Altmetric BadgeChapter 9 Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
-
Altmetric BadgeChapter 10 Operations on Weakly Recognizing Morphisms
-
Altmetric BadgeChapter 11 Descriptional Complexity of Bounded Regular Languages
-
Altmetric BadgeChapter 12 The Complexity of Languages Resulting from the Concatenation Operation
-
Altmetric BadgeChapter 13 Minimal and Reduced Reversible Automata
-
Altmetric BadgeChapter 14 Unary Self-verifying Symmetric Difference Automata
-
Altmetric BadgeChapter 15 State Complexity of Prefix Distance of Subregular Languages
-
Altmetric BadgeChapter 16 Two Results on Discontinuous Input Processing
Altmetric Badge
About this Attention Score
-
Good Attention Score compared to outputs of the same age (65th percentile)
-
High Attention Score compared to outputs of the same age and source (83rd percentile)
Citations
- dimensions_citation
- 1 Dimensions
Readers on
- mendeley
- 1 Mendeley