An order topology for finitely generated free monoids

DOI10.1007/BF02573306zbMATH Open0682.06012MaRDI QIDQ1823968FDOQ1823968

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• Order extension of order monomorphisms on a preordered topological space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)