Canonical finite models of Kleene algebra with tests
DOI10.1016/J.JLAMP.2015.11.001zbMATH Open1407.68321OpenAlexW2213295336WikidataQ114851591 ScholiaQ114851591MaRDI QIDQ299196FDOQ299196
Publication date: 22 June 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.11.001
Recommendations
regular languagecompleteness theoremcanonical finite modelKleene algebra with testsprogram optimizationsyntactic semiring
Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25)
Cites Work
- KAT-ML: an interactive theorem prover for Kleene algebra with tests
- NetKAT
- Title not available (Why is that?)
- Characterizations of locally testable events
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Dynamic algebras: Examples, constructions, applications
- A completeness theorem for Kleene algebras and the algebra of regular events
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- KAT + B!
- Kleene Algebra with Equations
- Mathematical Foundations of Computer Science 2004
- A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
- Title not available (Why is that?)
- On Hoare logic and Kleene algebra with tests
- A coalgebraic approach to Kleene algebra with tests
Uses Software
This page was built for publication: Canonical finite models of Kleene algebra with tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299196)
