Branching Measures and Nearly Acyclic NFAs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Branching Measures and Nearly Acyclic NFAs

Chris Keeler
  • Function : Author
  • PersonId : 1024582
Kai Salomaa
  • Function : Author
  • PersonId : 1022715


To get a more comprehensive understanding of the branching complexity of nondeterministic finite automata (NFA), we introduce and study the string path width and depth path width measures. The string path width on a string w counts the number of all complete computations on w, and the depth path width on an integer $\ell $ counts the number of complete computations on all strings of length $\ell $. We give an algorithm to decide the finiteness of the depth path width of an NFA. Deciding finiteness of string path width can be reduced to the corresponding question on ambiguity.An NFA is nearly acyclic if any computation can pass through at most one cycle. The class of nearly acyclic NFAs consists of exactly all NFAs with finite depth path width. Using this characterization we show that the finite depth path width of an m-state NFA over a k-letter alphabet is at most $(k+1)^{m-1}$ and that this bound is tight. The nearly acyclic NFAs recognize exactly the class of constant density regular languages.
Fichier principal
Vignette du fichier
440206_1_En_16_Chapter.pdf (317.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657000 , version 1 (06-12-2017)





Chris Keeler, Kai Salomaa. Branching Measures and Nearly Acyclic NFAs. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.202-213, ⟨10.1007/978-3-319-60252-3_16⟩. ⟨hal-01657000⟩
36 View
166 Download



Gmail Facebook X LinkedIn More