Sparse and slender subsets of monoids.

DOI10.1007/s00233-007-9009-5zbMath1149.20052OpenAlexW2068842183MaRDI QIDQ2480765

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

sparse setsfree monoidslanguagesmultiple loop setsslender setsunambiguous rational sets

Mathematics Subject Classification ID

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

Uses Software

• ALGOL 60

Cites Work

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• Numeration systems, linear recurrences, and regular sets
• Thin and slender languages
• On Parikh slender languages and power series
• Semigroups, Presburger formulas, and languages
• Bounded Algol-Like Languages
• Bounded Regular Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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