Kleene theorems for lasso languages and \(\omega \)-languages

DOI10.1007/978-981-97-2340-9_10MaRDI QIDQ6636074

Mike Cruchten

Publication date: 12 November 2024

zbMATH Keywords

Kleene theorem\( \omega \)-languageslasso languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Learning regular omega languages
• A completeness theorem for Kleene algebras and the algebra of regular events
• On syntactic congruences for \(\omega\)-languages
• Concurrent Kleene algebra: free model and completeness
• A Coalgebraic Decision Procedure for NetKAT
• Families of DFAs as Acceptors of omega-Regular Languages
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• Derivatives of Regular Expressions
• Ultimately periodic words of rational ω-languages

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