A homomorphic characterization of regular languages

DOI10.1016/0166-218X(82)90072-5MaRDI QIDQ1162364zbMATH OpenWikidataFDO

Authors Karel II Culik, Faith E. Fich, Arto Salomaa

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0166-218X(82)90072-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• scientific article; zbMATH DE number 3673546 (Why is no real title available?)
• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)

Cited in

(14)

• Equality sets of prefix morphisms and regular star languages
• Inverse morphic equivalence on languages
• On morphic generation of regular languages
• Representations of language families by homomorphic equality operations and generalized equality sets
• Bifaithful starry transductions
• A note on morphic characterization of languages
• A characterization of recognizable picture languages by tilings by finite sets
• Two characterizations of rational adherences
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• Homomorphisms on graph-walking automata
• scientific article; zbMATH DE number 3970124 (Why is no real title available?)
• A new normal form for the compositions of morphisms and inverse morphisms
• Characterizing regular languages with polynomial densities
• Homomorphisms and inverse homomorphisms on graph-walking automata

This page was built for publication: A homomorphic characterization of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162364)