# Nondeterminism Growth and State Complexity

Abstract : Tree width (respectively, string path width) measures the maximal number of partial (respectively, complete) computations of a nondeterministic finite automaton (NFA) on an input of given length. We study the growth rate of the tree width and string path width measures. As the main result we show that the degree of the polynomial bounding the tree width of an NFA differs by at most one from the degree of the polynomial bounding the string path width. Also we show that for $m \ge 4$ there exists an m-state NFA with finite string path width such that any equivalent finite tree width NFA needs $2^{m-2} + 1$ states.
Document type :
Conference papers
Domain :

Cited literature [14 references]

https://hal.inria.fr/hal-02387283
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 29, 2019 - 4:35:23 PM
Last modification on : Monday, December 7, 2020 - 9:44:02 AM

### File

480958_1_En_16_Chapter.pdf
Files produced by the author(s)

### Citation

Chris Keeler, Kai Salomaa. Nondeterminism Growth and State Complexity. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.210-222, ⟨10.1007/978-3-030-23247-4_16⟩. ⟨hal-02387283⟩

Record views