Rational bijection of rational sets

DOI10.1007/BF00288770zbMath0432.68051MaRDI QIDQ1138916

Maurice Nivat, Hermann Maurer

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

decidabilityrational setsrational transductionspopulation functionrational bijections

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Rational languages and the Burnside problem ⋮ Star-free sets of integers ⋮ Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508 ⋮ Bijective sequential mappings of a free monoid onto another ⋮ Semi-synchronous transductions ⋮ Recognizable tree-languages and nonlinear morphisms

Cites Work

• Transductions des langages de Chomsky
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rational bijection of rational sets