Sparse and slender subsets of monoids.

DOI10.1007/S00233-007-9009-5MaRDI QIDQ2480765zbMATH OpenOpenAlexFDO

Authors Juha Honkala

Publication date 3 April 2008

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00233-007-9009-5

zbMATH Keywords

free monoidslanguagesmultiple loop setsslender setssparse setsunambiguous rational sets

Mathematics Subject Classification ID

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

Recommendations

• On bounded rational trace languages
• scientific article; zbMATH DE number 3978429
• scientific article; zbMATH DE number 177837
• On the structure of the counting function of sparse context-free languages.
• On sparse languages \(L\) such that \(LL= \Sigma^*\)

Cites work

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• Bounded Algol-Like Languages
• Bounded Regular Sets
• scientific article; zbMATH DE number 3880130 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1086498 (Why is no real title available?)
• scientific article; zbMATH DE number 1408340 (Why is no real title available?)
• Numeration systems, linear recurrences, and regular sets
• On Parikh slender languages and power series
• Semigroups, Presburger formulas, and languages
• Thin and slender languages

Cited in

(2)

• scientific article; zbMATH DE number 5149703 (Why is no real title available?)
• SPARSE, THIN AND OTHER SUBSETS OF GROUPS

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Sparse and slender subsets of monoids.

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