Finite automata and unary languages
Theoretical Computer Science
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
On the power of Las Vegas II: two-way finite automata
Theoretical Computer Science
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Optimal Simulations between Unary Automata
SIAM Journal on Computing
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Errata to: "finite automata and unary languages"
Theoretical Computer Science
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Small sweeping 2NFAs are not closed under complement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An exponential gap between Las Vegas and deterministic sweeping finite automata
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
A deterministic sweeping automaton is a two-way deterministic automaton (2-DFA) which makes turns only at the left or right end of the input. We give a survey on recent lower bounds for the conciseness of sweeping automata. We also show that any sweeping automaton for the language (L$)* has to have at least √m/2 states whenever the nondeterministic message complexity of L is at least m. Thus we obtain the first general method to establish lower bounds on the conciseness of sweeping automata.