From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Many Faces of a Translation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton
IEEE Transactions on Computers
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
More Concise Representation of Regular Languages by Automata and Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
A characterization of two-way deterministic classes of languages
Journal of Computer and System Sciences
Multitape one-way nonwriting automata
Journal of Computer and System Sciences
The many faces of a translation
Journal of Computer and System Sciences
More concise representation of regular languages by automata and regular expressions
Information and Computation
Information Processing Letters
A note on prefixes of regular languages
ACM SIGACT News
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Two-way unary automata versus logarithmic space
Information and Computation
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
UC'11 Proceedings of the 10th international conference on Unconventional computation
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An alternating hierarchy for finite automata
Theoretical Computer Science
Loops and overloops for Tree-Walking Automata
Theoretical Computer Science
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Removing nondeterminism in constant height pushdown automata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Two-way transducers with a two-way output tape
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Computation with multiple CTCs of fixed length and width
Natural Computing: an international journal
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.02 |