A note on the reduction of two-way automata to one-way atuomata
Information Processing Letters
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Endmarkers can make a difference
Information Processing Letters
Properties that characterize LOGCFL
Journal of Computer and System Sciences
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Complexity results for two-way and multi-pebble automata and their logics
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Journal of the ACM (JACM)
View-based query processing for regular path queries with inverse
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automatic generation of efficient lexical processors using finite state techniques
Communications of the ACM
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Finite automata and their decision problems
IBM Journal of Research and Development
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on finite words, and extend it to automata on infinite words.