Kleene theorems for lasso languages and -languages

DOI10.1007/978-981-97-2340-9_10MaRDI QIDQ6636074zbMATH OpenFDO

Authors Mike Cruchten

Publication date 12 November 2024

zbMATH Keywords

Kleene theorem\( \omega \)-languageslasso languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3525042 (Why is no real title available?)
• scientific article; zbMATH DE number 7649888 (Why is no real title available?)
• A coalgebraic decision procedure for NetKAT
• A completeness theorem for Kleene algebras and the algebra of regular events
• Concurrent Kleene algebra: free model and completeness
• Derivatives of Regular Expressions
• Families of DFAs as Acceptors of omega-Regular Languages
• Learning regular omega languages
• On syntactic congruences for \(\omega\)-languages
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• Ultimately periodic words of rational ω-languages

This page was built for publication: Kleene theorems for lasso languages and \(\omega \)-languages

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