Languages recognized by programs over the two-element monoid

DOI10.1007/BF02573245MaRDI QIDQ1118041zbMATH OpenFDO

Authors Gerard Lallement

Publication date 1989

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/134968

zbMATH Keywords

finite monoidlanguages in binary alphabetrecognizable by programs

Mathematics Subject Classification ID

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

Recommendations

• Recognisable languages over monads
• Recognizable languages in concurrency monoids
• Recognizable languages in divisibility monoids
• scientific article; zbMATH DE number 1390068
• A kleene theorem for recognizable languages over concurrency monoids
• Languages and monoids with disjunctive identity
• Monadic second-order definable text languages
• Classes of two-dimensional languages and recognizability conditions
• scientific article; zbMATH DE number 2124368
• scientific article; zbMATH DE number 50943

Cited in

(3)

• Programs over aperiodic monoids
• Recognizable languages in divisibility monoids
• Gérard Lallement (1935-2006)

This page was built for publication: Languages recognized by programs over the two-element monoid

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