Every iterated morphism yields a co-CFL (Q1069710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90034-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014324236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Hierarchy of Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite square-free co-CFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of an infinite square-free co-CFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646912 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:45, 17 June 2024

scientific article
Language Label Description Also known as
English
Every iterated morphism yields a co-CFL
scientific article

    Statements

    Every iterated morphism yields a co-CFL (English)
    0 references
    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

    Identifiers