AbstractWe prove that O(e√n log n) states are sufficient to simulate an n-state 1nfa recognizing a unary language by a 1dfa. The lower bound is the same. Similar tight bounds are shown for the simulation of a 2dfa by a 1dfa and a 1nfa. We also show that O(n2) states are sufficient and necessary to simulate an n-state 1nfa recognizing a unary language by a 2dfa
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We use results from communication complexity, both new and old ones, to prove lower bounds for unamb...
AbstractWe prove that O(e√n log n) states are sufficient to simulate an n-state 1nfa recognizing a u...
AbstractNondeterministic finite automata (NFA) with at most one accepting computation on every input...
We show that, on inputs of length exceeding 5n(2), any n-state unary 2nfa (two-way nondeterministic ...
We consider the problem of computing the costs - in terms of states - of optimal simulations between...
Abstract. NFA (Non-deterministic Finite Automata) usually require significantly less states than DFA...
We show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic finite a...
AbstractWe show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic ...
We consider the problem of computing the costs---{ in terms of states---of optimal simulations betwe...
We consider simulating finite automata (both deterministic and nondeterministic) with context-free g...
We show that each n-state unary 2nfa (a two-way nondeterministic finite automaton) can be simulated ...
AbstractWe consider the state complexities of some basic operations on regular languages. We show th...
A tight lower bound on the number of states of two\u2013way deterministic and nondeterministic autom...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We use results from communication complexity, both new and old ones, to prove lower bounds for unamb...
AbstractWe prove that O(e√n log n) states are sufficient to simulate an n-state 1nfa recognizing a u...
AbstractNondeterministic finite automata (NFA) with at most one accepting computation on every input...
We show that, on inputs of length exceeding 5n(2), any n-state unary 2nfa (two-way nondeterministic ...
We consider the problem of computing the costs - in terms of states - of optimal simulations between...
Abstract. NFA (Non-deterministic Finite Automata) usually require significantly less states than DFA...
We show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic finite a...
AbstractWe show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic ...
We consider the problem of computing the costs---{ in terms of states---of optimal simulations betwe...
We consider simulating finite automata (both deterministic and nondeterministic) with context-free g...
We show that each n-state unary 2nfa (a two-way nondeterministic finite automaton) can be simulated ...
AbstractWe consider the state complexities of some basic operations on regular languages. We show th...
A tight lower bound on the number of states of two\u2013way deterministic and nondeterministic autom...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We use results from communication complexity, both new and old ones, to prove lower bounds for unamb...
DOI
Add to ORKG