String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776)
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: String-matching cannot be done by a two-head one-way deterministic finite automaton |
scientific article; zbMATH DE number 3952036
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | String-matching cannot be done by a two-head one-way deterministic finite automaton |
scientific article; zbMATH DE number 3952036 |
Statements
String-matching cannot be done by a two-head one-way deterministic finite automaton (English)
0 references
1986
0 references
Kolmogorov complexity
0 references
k-head finite automata, lower bounds
0 references
0 references
