Notes on finitely generated semigroups and pumping conditions for regular languages

DOI10.1016/0304-3975(86)90021-6zbMath0606.20048OpenAlexW2049702451MaRDI QIDQ1084511

Kosaburo Hashiguchi

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90021-6

zbMATH Keywords

free semigroupregular languagefiniteness conditionscontext-free languagesfinitely generated semigrouppumping conditions

Mathematics Subject Classification ID

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

Related Items (4)

Notes on congruence relations and factor pumping conditions for rational languages ⋮ Some combinatorial properties of infinite words and applications to semigroup theory ⋮ A finiteness condition for semigroups generalizing a theorem of Hotzel ⋮ Finiteness and iteration conditions for semigroups

Cites Work

• On finiteness conditions in semigroups
• Pumping Lemmas for Regular Sets
• A finiteness condition for finitely generated semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Notes on finitely generated semigroups and pumping conditions for regular languages