Comment on a remark of Forys

DOI10.1016/0304-3975(89)90170-9MaRDI QIDQ1823712zbMATH OpenOpenAlexFDO

Authors 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

alphabetic morphismsfactorizationrational transductionset of fixed points

Mathematics Subject Classification ID

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

Recommendations

• Fixed point languages of rational transductions
• On fixed points of rational transductions
• scientific article; zbMATH DE number 897896
• Compositional representation of rational functions
• Cyclic rational transductions and polynomials of rational functions

Cites work

• Equality languages and fixed point languages
• Fixed point languages of rational transductions
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)

Cited in

(4)

• On fixed points of rational transductions
• Fixed point languages of rational transductions
• scientific article; zbMATH DE number 3926275 (Why is no real title available?)
• scientific article; zbMATH DE number 897896 (Why is no real title available?)

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

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