Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Complementing two-way finite automata
Information and Computation
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On probabilistic pushdown automata
Information and Computation
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
Hi-index | 5.23 |