Nondeterminism versus determinism of finite automata over directed acyclic graphs
Potthoff, Andreas ; Seibert, Sebastian ; Thomas, Wolfgang
Bull. Belg. Math. Soc. Simon Stevin, Tome 1 (1994) no. 2, p. 285-298 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1994-05-14
Classification:  Labelled finite graphs,  recognizability of graph languages,  automata on acyclic graphs,  non deterministic graph automata,  deterministic graph automata,  68Q68,  03D05,  68Q10,  68R10 
@article{1103408550,
     author = {Potthoff, Andreas and Seibert, Sebastian and Thomas, Wolfgang},
     title = {Nondeterminism versus determinism of finite automata over directed acyclic graphs},
     journal = {Bull. Belg. Math. Soc. Simon Stevin},
     volume = {1},
     number = {2},
     year = {1994},
     pages = { 285-298},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1103408550}
}

Potthoff, Andreas; Seibert, Sebastian; Thomas, Wolfgang. Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belg. Math. Soc. Simon Stevin, Tome 1 (1994) no. 2, pp.  285-298. http://gdmltest.u-ga.fr/item/1103408550/