Finite automata on directed graphs (Q1191024)
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: Finite automata on directed graphs |
scientific article; zbMATH DE number 58910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite automata on directed graphs |
scientific article; zbMATH DE number 58910 |
Statements
Finite automata on directed graphs (English)
0 references
27 September 1992
0 references
From author's presentation: In the first section are given the basic notation, the formal definition of graph automata (GA) and examples showing how different types of automata can be expressed in terms of GA. In sections 2-4 the closure properties of GA and the proofs of these properties under intersection are presented. Finally, in section 5, is proved that the emptiness problem for GA is decidable.
0 references
graph automata
0 references
closure properties
0 references
emptiness problem
0 references
0.92148924
0 references
0.92148924
0 references
0.9164204
0 references
0.89922017
0 references
0.89167506
0 references
0.8891139
0 references
