Equality languages and fixed point languages
From MaRDI portal
Publication:3856116
DOI10.1016/S0019-9958(79)90082-2zbMath0422.68034MaRDI QIDQ3856116
Joost Engelfriet, Grzegorz Rozenberg
Publication date: 1979
Published in: Information and Control (Search for Journal in Brave)
homomorphismsclosure propertieselementary homomorphismsequality languagesdgsm mappingsfixed-point languagessymmetric dgsm mappings
Related Items
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, The poset of retracts of a free monoid, The lattice of semiretracts of a free monoid, Multiple equality sets and Post machines, On some transducer equivalence problems for families of languages, Reachability via Cooperating Morphisms, ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS, Fixed point languages of rational transductions, Comment on a remark of Forys, ON THE DUAL POST CORRESPONDENCE PROBLEM, Expanded subalphabets in the theories of languages and semigroups†
