Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar (Q2878045)
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: Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar |
scientific article; zbMATH DE number 6335432
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar |
scientific article; zbMATH DE number 6335432 |
Statements
28 August 2014
0 references
formal languages
0 references
quasi-deterministic virtual finite automaton
0 references
regular grammar
0 references
Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar (English)
0 references
