Abstract
We study the interrelationships between various measures of nondeterminism for finite automata. The tree width of an NFA (nondeterministic finite automaton) A is a function that associates a positive integer n to the maximum number of leaves in any computation tree of A on an input of length n. The trace of an NFA is defined in terms of the maximum product of the degrees of nondeterministic choices in computation on inputs of given length. We establish upper and lower bounds for the trace function of an NFA in terms of its tree width. Additionally, the unbounded trace of an NFA has exponential growth. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Palioudakis, A., Salomaa, K., & Akl, S. G. (2013). Comparisons between measures of nondeterminism on finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8031 LNCS, pp. 217–228). https://doi.org/10.1007/978-3-642-39310-5_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
