Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

DOI10.1145/2676726.2677007zbMath1346.68120arXiv1407.3213WikidataQ131118406 ScholiaQ131118406MaRDI QIDQ2819822

Damien Pous

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3213

zbMATH Keywords

language equivalencebinary decision diagramsBDDKleene algebra with testsunion-findsymbolic automataBrzozowski's derivativesAntimirov' partial derivativesdisjoint set forestsguarded string automataKAT

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Nominal Kleene Coalgebra ⋮ Completeness and incompleteness in nominal Kleene algebra ⋮ Deciding Synchronous Kleene Algebra with Derivatives ⋮ Unnamed Item ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Almost event-rate independent monitoring

This page was built for publication: Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests