scientific article; zbMATH DE number 1047932

zbMATH Open0900.20149MaRDI QIDQ4348013FDOQ4348013

Authors: Tom Head, Masami Ito 

Publication date: 9 February 1998

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

Recommendations

• Recognizable subsets of semigroups
• Some algorithms on the star operation applied to finite languages
• Free submonoids in the monoid of languages
• scientific article; zbMATH DE number 1948500
• A note on the free submonoids of the monoid of prefix codes

zbMATH Keywords

minimal generating setsregular languagespower absorptionfull uniform codesRPA subsemigroupssubsets of free monoids

Mathematics Subject Classification ID

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

Cited In (2)

• Post-plus languages
• On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems

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 Q4348013)