Add to ORKGWe 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
An iterative array is a line of interconnected interacting finite automata. One distinguished automa...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
We consider the problem of computing the costs - in terms of states - of optimal simulations between...
AbstractWe describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating a...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
One of the main problems in automata theory is evaluating the cost, in terms of states, of the ...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
AbstractR. Kannan conjectured that every non-deterministic two-way finite automaton can be positiona...
AbstractWe show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic ...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
The question of the state-size cost for simulation of two-way nondeterministic automata (2 nfas) by ...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
We show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic finite a...
AbstractWe give a proof that alternating tree automata can be simulated by nondeterministic tree aut...
Abstract. Alternating automata play a key role in the automata-theoretic ap-proach to specification,...
An iterative array is a line of interconnected interacting finite automata. One distinguished automa...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
We consider the problem of computing the costs - in terms of states - of optimal simulations between...
AbstractWe describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating a...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
One of the main problems in automata theory is evaluating the cost, in terms of states, of the ...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
AbstractR. Kannan conjectured that every non-deterministic two-way finite automaton can be positiona...
AbstractWe show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic ...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
The question of the state-size cost for simulation of two-way nondeterministic automata (2 nfas) by ...
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rab...
We show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic finite a...
AbstractWe give a proof that alternating tree automata can be simulated by nondeterministic tree aut...
Abstract. Alternating automata play a key role in the automata-theoretic ap-proach to specification,...
An iterative array is a line of interconnected interacting finite automata. One distinguished automa...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
We consider the problem of computing the costs - in terms of states - of optimal simulations between...