Nondeterminism versus determinism of finite automata over directed acyclic graphs.

Potthoff, Andreas, Seibert, Sebastian, and Thomas, Wolfgang. "Nondeterminism versus determinism of finite automata over directed acyclic graphs.." Bulletin of the Belgian Mathematical Society - Simon Stevin 1.2 (1994): 285-298. <http://eudml.org/doc/226178>.

@article{Potthoff1994,
author = {Potthoff, Andreas, Seibert, Sebastian, Thomas, Wolfgang},
journal = {Bulletin of the Belgian Mathematical Society - Simon Stevin},
keywords = {labelled finite graphs; recognizability of graph languages; automata on acyclic graphs; non-deterministic graph automata; deterministic graph automata; finite-state graph automata; directed acyclic graphs},
language = {eng},
number = {2},
pages = {285-298},
publisher = {Société Mathématique de Belgique - Belgisch Wiskundig Genootschap},
title = {Nondeterminism versus determinism of finite automata over directed acyclic graphs.},
url = {http://eudml.org/doc/226178},
volume = {1},
year = {1994},
}

TY - JOUR
AU - Potthoff, Andreas
AU - Seibert, Sebastian
AU - Thomas, Wolfgang
TI - Nondeterminism versus determinism of finite automata over directed acyclic graphs.
JO - Bulletin of the Belgian Mathematical Society - Simon Stevin
PY - 1994
PB - Société Mathématique de Belgique - Belgisch Wiskundig Genootschap
VL - 1
IS - 2
SP - 285
EP - 298
LA - eng
KW - labelled finite graphs; recognizability of graph languages; automata on acyclic graphs; non-deterministic graph automata; deterministic graph automata; finite-state graph automata; directed acyclic graphs
UR - http://eudml.org/doc/226178
ER -