String and graph grammar characterizations of bounded regular languages (Q4194489)
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: String and graph grammar characterizations of bounded regular languages |
scientific article; zbMATH DE number 3633749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | String and graph grammar characterizations of bounded regular languages |
scientific article; zbMATH DE number 3633749 |
Statements
String and graph grammar characterizations of bounded regular languages (English)
0 references
1978
0 references
Bounded Regular Languages
0 references
Recognition By Automata
0 references
State Graph
0 references
Graph Grammars
0 references
Sequential Right-Linear String Grammar
0 references
Second-Order Contextfree Graph Grammar
0 references
