Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nondeterminism versus determinism of finite automata over directed acyclic graphs |
scientific article; zbMATH DE number 589788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nondeterminism versus determinism of finite automata over directed acyclic graphs |
scientific article; zbMATH DE number 589788 |
Statements
Nondeterminism versus determinism of finite automata over directed acyclic graphs (English)
0 references
15 June 1994
0 references
labelled finite graphs
0 references
recognizability of graph languages
0 references
automata on acyclic graphs
0 references
non-deterministic graph automata
0 references
deterministic graph automata
0 references
finite-state graph automata
0 references
directed acyclic graphs
0 references
