Regular expressions and the equivalence of programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3983152 (Why is no real title available?)
- scientific article; zbMATH DE number 3448070 (Why is no real title available?)
- scientific article; zbMATH DE number 3212011 (Why is no real title available?)
- scientific article; zbMATH DE number 3229496 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3313249 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- Algorithmic properties of structures
- On Ianov's Program Schemata
- Programming Languages and Computers: A Unified Metatheory
- Two Complete Axiom Systems for the Algebra of Regular Events
- Unsolvability in 3 × 3 Matrices
Cited in
(15)- The Böhm–Jacopini Theorem Is False, Propositionally
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings
- On the coalgebraic theory of Kleene algebra with tests
- Fixing Zeno gaps
- A note on infinite trees
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Observations on the complexity of regular expression problems
- On program schemata equivalence
- A coalgebraic approach to Kleene algebra with tests
- Synchronous Kleene algebra
- A survey of state vectors
- Deciding Kleene algebra terms equivalence in Coq
- A goal-directed decision procedure for hybrid PDL
- Pair grammars, graph languages and string-to-graph translations
- Program equivalence and context-free grammars
This page was built for publication: Regular expressions and the equivalence of programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536436)
