Equality languages and fixed point languages

DOI10.1016/S0019-9958(79)90082-2MaRDI QIDQ3856116zbMATH OpenFDO

Authors Joost Engelfriet, Grzegorz Rozenberg

Publication date 1979

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(79)90082-2

zbMATH Keywords

closure propertiesdgsm mappingselementary homomorphismsequality languagesfixed-point languageshomomorphismssymmetric dgsm mappings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(13)

• Balance of many-valued transductions and equivalence problems
• Representations of language families by homomorphic equality operations and generalized equality sets
• Prefix and equality languages of rational functions are co-context-free
• Multiple equality sets and Post machines
• Fixed point languages of rational transductions
• Comment on a remark of Forys
• The poset of retracts of a free monoid
• ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS
• On some transducer equivalence problems for families of languages
• Expanded subalphabets in the theories of languages and semigroups†
• The lattice of semiretracts of a free monoid
• Reachability via cooperating morphisms
• On the dual Post correspondence problem

This page was built for publication: Equality languages and fixed point languages

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