On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:02, 5 March 2024
scientific article; zbMATH DE number 7413805
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Length of Shortest Strings Accepted by Two-way Finite Automata |
scientific article; zbMATH DE number 7413805 |
Statements
On the Length of Shortest Strings Accepted by Two-way Finite Automata (English)
0 references
25 October 2021
0 references
finite automata
0 references
two-way automata
0 references
state complexity
0 references
shortest string
0 references
