Finite automata and unary languages
Theoretical Computer Science
Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
On measuring nondeterminism in regular languages
Information and Computation
Intersection and union of regular languages and state complexity
Information Processing Letters
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
SIAM Journal on Computing
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Handbook of formal languages, vol. 1
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
SIAM Journal on Computing
Descriptional complexity of deterministic finite automata with multiple initial states
Journal of Automata, Languages and Combinatorics
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
A Second Course in Formal Languages and Automata Theory
A Second Course in Formal Languages and Automata Theory
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input string has a constant number of branches. We give effective characterizations of ftw-NFAs and a tight worst-case state size bound for determinizing an ftw-NFA A as a function of the tree width and the number of states of A. We introduce a lower bound technique for ftw-NFAs and consider the operational state complexity of this model.