A homomorphic characterization of principal semi AFLs without using intersection with regular sets
From MaRDI portal
Publication:1836994
DOI10.1016/0020-0255(82)90057-3zbMath0506.68063OpenAlexW2026366548WikidataQ122932159 ScholiaQ122932159MaRDI QIDQ1836994
Publication date: 1982
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(82)90057-3
Related Items
Representation of rational functions with prefix and suffix codings ⋮ On purely morphic characterizations of context-free languages ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Bifaithful starry transductions ⋮ Compositional representation of rational functions ⋮ A new normal form for the compositions of morphisms and inverse morphisms ⋮ The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction ⋮ Decidability problems for unary output sequential transducers ⋮ On characterisation of language families in terms of inverse morphisms ⋮ Unnamed Item ⋮ Two characterizations of rational adherences ⋮ Finite transducers and rational transductions ⋮ A characterization of recognizable picture languages by tilings by finite sets ⋮ Inverse morphic equivalence on languages ⋮ Deterministic sequential functions
Cites Work
