Notes on congruence relations and factor pumping conditions for rational languages

DOI10.1016/0304-3975(88)90044-8zbMath0656.68082OpenAlexW2064302415MaRDI QIDQ1110344

Kosaburo Hashiguchi

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90044-8

zbMATH Keywords

idempotentfree semigroupcongruencefinite groupperiodicalphabetfinite semigroupPumping conditions

Mathematics Subject Classification ID

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

Related Items

Finiteness and iteration conditions for semigroups

Cites Work

• Notes on finitely generated semigroups and pumping conditions for regular languages
• 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