On morphic generation of regular languages

DOI10.1016/0166-218X(86)90018-1zbMath0604.68084OpenAlexW2013930226MaRDI QIDQ1083217

Juhani Karhumäki, H. C. M. Kleijn, Tero J.Harju

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90018-1

zbMATH Keywords

regular languagesmorphismsinverse morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On hardest languages for one-dimensional cellular automata ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ On hardest languages for one-dimensional cellular automata

Cites Work

• A homomorphic characterization of regular languages
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• The Hardest Context-Free Language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On morphic generation of regular languages