Deciding Synchronous Kleene Algebra with Derivatives
From MaRDI portal
Publication:2947408
DOI10.1007/978-3-319-22360-5_5zbMath1465.68192MaRDI QIDQ2947408
No author found.
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://repositorio-aberto.up.pt/handle/10216/90793
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Synchronous Kleene algebra
- The Esterel synchronous programming language: Design, semantics, implementation
- Proof Pearl: regular expression equivalence and relation algebra
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
- On the Average Size of Glushkov and Equation Automata for KAT Expressions
- Unified Decision Procedures for Regular Expression Equivalence
- Deciding Kleene Algebras in Coq
- Deciding Regular Expressions (In-)Equivalence in Coq
- Checking NFA equivalence with bisimulations up to congruence
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- THE ABSTRACT THEORY OF AUTOMATA
- On the Coalgebraic Theory of Kleene Algebra with Tests
- Position Automata for Kleene Algebra with Tests
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- Coinductive Proof Techniques for Language Equivalence
- On the Equivalence of Automata for KAT-expressions
- Applications of Symbolic Finite Automata
- Partial Derivative Automaton for Regular Expressions with Shuffle
- Programming Techniques: Regular expression search algorithm
- On Hoare logic and Kleene algebra with tests
