A homomorphic characterization of regular languages

DOI10.1016/0166-218X(82)90072-5zbMath0481.68069WikidataQ123366249 ScholiaQ123366249MaRDI QIDQ1162364

Karel II Culik, Faith E. Fich, Arto Salomaa

Publication date: 1982

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On morphic generation of regular languages ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Homomorphisms on graph-walking automata ⋮ Bifaithful starry transductions ⋮ Characterizing regular languages with polynomial densities ⋮ Homomorphisms and inverse homomorphisms on graph-walking automata ⋮ A new normal form for the compositions of morphisms and inverse morphisms ⋮ A note on morphic characterization of languages ⋮ Unnamed Item ⋮ Two characterizations of rational adherences ⋮ Equality sets of prefix morphisms and regular star languages ⋮ A homomorphic characterization of principal semi AFLs without using intersection with regular sets ⋮ A characterization of recognizable picture languages by tilings by finite sets ⋮ Inverse morphic equivalence on languages

Cites Work

• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item