Every iterated morphism yields a co-CFL (Q1069710)
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: Every iterated morphism yields a co-CFL |
scientific article; zbMATH DE number 3936539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every iterated morphism yields a co-CFL |
scientific article; zbMATH DE number 3936539 |
Statements
Every iterated morphism yields a co-CFL (English)
0 references
1986
0 references
The set of left factors of any infinite word generated by an iterated morphism is shown to be the complement of a one-counter context-free language. This is used to solve a problem stated by \textit{M. G. Main}, \textit{W. Bucher} and \textit{D. Haussler} [Lect. Notes Comput. Sci. 194, 404- 412 (1985)].
0 references
permutation-free word
0 references
one-counter context-free language
0 references
0.8124849796295166
0 references
0.7868027091026306
0 references
0.777929425239563
0 references
