A generalization of Kleene's theorem and nondeterministic structured programming
DOI10.1016/S0019-9958(81)90235-7zbMath0514.20053OpenAlexW2023491389MaRDI QIDQ3659997
Octavian Stanasila, Valeriu Breazu
Publication date: 1981
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(81)90235-7
automatacomplete latticelanguagesconcatenationlinguisticsKleene's theoremcompletely ordered monoidrecognizable elements
Formal languages and automata (68Q45) Complete lattices, completions (06B23) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Ordered semigroups and monoids (06F05)
This page was built for publication: A generalization of Kleene's theorem and nondeterministic structured programming