Determinism vs. nondeterminism for two-way automata. Representing the meaning of states by logical formulæ (Q3167481)
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: Determinism vs. nondeterminism for two-way automata. Representing the meaning of states by logical formulæ |
scientific article; zbMATH DE number 6101624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determinism vs. nondeterminism for two-way automata. Representing the meaning of states by logical formulæ |
scientific article; zbMATH DE number 6101624 |
Statements
Determinism vs. Nondeterminism for Two-Way Automata (English)
0 references
2 November 2012
0 references
nondeterminism
0 references
two-way finite automata
0 references
state complexity
0 references
0.9936040043830872
0 references
0.8054090738296509
0 references
0.795879065990448
0 references
0.7901120185852051
0 references
0.78920578956604
0 references
