Finite automata and unary languages
Theoretical Computer Science
Automata and Computability
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Special Case of a Unary Regular Language Containment
Theory of Computing Systems
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Efficient construction of semilinear representations of languages accepted by unary NFA
RP'10 Proceedings of the 4th international conference on Reachability problems
Two-way unary automata versus logarithmic space
Information and Computation
Chrobak normal form revisited, with applications
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.89 |
We point out a subtle error in the proof of Chrobak's theorem that every unary NFA can be represented as a union of arithmetic progressions that is at most quadratically large. We propose a correction for this and show how Martinez's polynomial time algorithm, which realizes Chrobak's theorem, can be made correct accordingly. We also show that Martinez's algorithm cannot be improved to have logarithmic space, unless L = NL.