Abstract
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. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Palioudakis, A., Salomaa, K., & Akl, S. G. (2012). State complexity and limited nondeterminism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 252–265). https://doi.org/10.1007/978-3-642-31623-4_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
