scientific article

zbMath0423.20053MaRDI QIDQ3856952

Christian Choffrut

Publication date: 1978

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

free monoidsrecognizable transduction

Mathematics Subject Classification ID

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

Related Items (5)

Rational languages and the Burnside problem ⋮ Addition molle et fonctions p-locales ⋮ A note on the equivalence problem of rational formal power series ⋮ Rational relations and rational series ⋮ On cancellation properties of languages which are supports of rational power series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transductions des langages de Chomsky
• Matrices de Hankel
• On some questions of rationality and decidability
• On Relations Defined by Generalized Finite Automata

This page was built for publication: