A Kleene theorem for bisemigroup and binoid languages

DOI10.1142/S012905411100812XMaRDI QIDQ3086249zbMATH OpenOpenAlexFDO

Authors Zsolt Gazdag, Zoltán Németh

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

regularityrationalityautomatarecognizabilitylanguagesbinoidsKleene theoremsbisemigroups

Mathematics Subject Classification ID

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

Recommendations

• Regular binoid expressions and regular binoid languages.
• scientific article; zbMATH DE number 1502105
• Automata on infinite biposets
• Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
• On the semigroup languages and the regular languages

Cites work

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

Cited in

(6)

• Some results in \(R\)-biordered set languages
• Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
• scientific article; zbMATH DE number 2211803 (Why is no real title available?)
• On the Kleijn-Rozenberg k-adjacent languages
• scientific article; zbMATH DE number 437483 (Why is no real title available?)
• Automata on infinite biposets

This page was built for publication: A Kleene theorem for bisemigroup and binoid languages

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