Nondeterminism versus determinism of finite automata over directed acyclic graphs

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Bulletin of the Belgian Mathematical Society, Simon Stevin Simon Stevin, 1994, Vol.1 (2), p.285-298
Hauptverfasser:	POTTHOFF, A, SEIBERT, S, THOMAS, W
Format:	Artikel
Sprache:	eng
Schlagworte:	03D05 68Q10 68Q68 68R10 Algorithmics. Computability. Computer arithmetics Applied sciences automata on acyclic graphs Automata. Abstract machines. Turing machines Computer science control theory systems deterministic graph automata Exact sciences and technology Information retrieval. Graph Labelled finite graphs Logic and foundations Mathematical logic, foundations, set theory Mathematics non deterministic graph automata recognizability of graph languages Recursion theory Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!