On purely morphic characterizations of context-free languages

DOI10.1016/0304-3975(87)90038-7zbMath0636.68095OpenAlexW2044040644MaRDI QIDQ1098315

Takashi Yokomori

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90038-7

zbMATH Keywords

homomorphismcontext-free languageDyck sethomomorphic characterizations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inverse homomorphic characterization of full principal AFL
• A note on morphic characterization of languages
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• The Hardest Context-Free Language
• A representation theorem for algebraic and context-free power series in noncommuting variables