scientific article; zbMATH DE number 3658049

zbMATH Open0423.20053MaRDI QIDQ3856952FDOQ3856952

Authors: Christian Choffrut 

Publication date: 1978

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

Title of this publication is not available (Why is that?)

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

• Title not available (Why is that?)
• On Relations Defined by Generalized Finite Automata
• Matrices de Hankel
• Transductions des langages de Chomsky
• On some questions of rationality and decidability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

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

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)