A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES

DOI10.1142/S012905411100812XzbMath1222.68104OpenAlexW2087987102MaRDI QIDQ3086249

Zoltán L. Németh, Zsolt Gazdag

Publication date: 30 March 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411100812x

zbMATH Keywords

regularityautomatarationalitylanguagesrecognizabilitybinoidsKleene theoremsbisemigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Unnamed Item

Cites Work

• Axiomatizing the identities of binoid languages
• Regular binoid expressions and regular binoid languages.
• Series-parallel languages and the bounded-width property
• A note on identities of two-dimensional languages
• Rationality in algebras with a series operation
• Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids

This page was built for publication: A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES