scientific article; zbMATH DE number 3658049

MaRDI QIDQ3856952zbMATH OpenFDO

Authors Christian Choffrut

Publication date 1978

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

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)

Cites work

• scientific article; zbMATH DE number 3671713 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3557670 (Why is no real title available?)
• scientific article; zbMATH DE number 3569844 (Why is no real title available?)
• Matrices de Hankel
• On Relations Defined by Generalized Finite Automata
• On some questions of rationality and decidability
• Transductions des langages de Chomsky

Cited in

(6)

• Addition molle et fonctions p-locales
• Rational relations and rational series
• On cancellation properties of languages which are supports of rational power series
• Theoretical computer science: computational complexity
• Rational languages and the Burnside problem
• A note on the equivalence problem of rational formal power series

This page was built for publication:

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