Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata (Q2708953)
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: Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata |
scientific article |
Statements
7 November 2001
0 references
planar automata
0 references
forgetting automata
0 references
Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata (English)
0 references
