Fixed point languages of rational transductions

DOI10.1007/BF02573161zbMath0618.68065OpenAlexW2099633252MaRDI QIDQ1822509

Wit Foryś

Publication date: 1986

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134837

zbMATH Keywords

fixed pointscontext-sensitive languagerational relationsrational transductionsfixed point languagequalitative theory of equation in free monoids

Mathematics Subject Classification ID

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

Related Items (2)

Some Characterization of Recursively Enumerable Sets ⋮ Comment on a remark of Forys

Cites Work

• Transductions des langages de Chomsky
• Sur diverses familles de langages fermées par transduction rationnelle
• Equality languages and fixed point languages
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed point languages of rational transductions