A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES

DOI10.1142/S012905411100812XzbMATH Open1222.68104OpenAlexW2087987102MaRDI QIDQ3086249FDOQ3086249

Zoltán 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

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)

Cites Work

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

Cited In (3)

• Some results in \(R\)-biordered set languages
• On the Kleijn-Rozenberg k-adjacent languages
• Title not available (Why is that?)

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)