An order topology for finitely generated free monoids

DOI10.1007/BF02573306MaRDI QIDQ1823968zbMATHFDO

Authors Michael Gass

Publication date 1989

Published in Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

order topologymaximal codesembedding a finitely generated free monoid as a dense subset of the unit intervalthin code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Ordered topological structures (06F30) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• On codes having no finite completions
• Maximality of codes in free monoids
• Monoids and maximal codes
• scientific article; zbMATH DE number 3987346

Cited in

(5)

• scientific article; zbMATH DE number 19479 (Why is no real title available?)
• scientific article; zbMATH DE number 3975244 (Why is no real title available?)
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• scientific article; zbMATH DE number 3987346 (Why is no real title available?)
• Order extension of order monomorphisms on a preordered topological space

This page was built for publication: An order topology for finitely generated free monoids

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