Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound (Q6175095)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7729463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound |
scientific article; zbMATH DE number 7729463 |
Statements
Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound (English)
0 references
17 August 2023
0 references
0 references
