Finite graph automata for linear and boundary graph languages (Q1770387)
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 graph automata for linear and boundary graph languages |
scientific article; zbMATH DE number 2153185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite graph automata for linear and boundary graph languages |
scientific article; zbMATH DE number 2153185 |
Statements
Finite graph automata for linear and boundary graph languages (English)
0 references
6 April 2005
0 references
Node labelled graphs
0 references
Graph grammars
0 references
Finite graph automata
0 references
Alternating graph automata
0 references
Graph searching
0 references
0 references
0 references
0.914889633655548
0 references
0.7952673435211182
0 references
0.7923262119293213
0 references
0.7849165797233582
0 references
