Comment on a remark of Forys

DOI10.1016/0304-3975(89)90170-9zbMath0681.68098OpenAlexW2041612507MaRDI QIDQ1823712

C. P. Rupert

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90170-9

zbMATH Keywords

factorizationrational transductionset of fixed pointsalphabetic morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Fixed point languages of rational transductions
• Equality languages and fixed point languages

This page was built for publication: Comment on a remark of Forys