Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nondeterminism versus determinism of finite automata over directed acyclic graphs |
scientific article |
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
