Regular expressions and the equivalence of programs

DOI10.1016/S0022-0000(69)80027-9zbMath0187.13603OpenAlexW2064204259MaRDI QIDQ2536436

David M. Kaplan

Publication date: 1969

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(69)80027-9

zbMATH Keywords

computer science and automata

Related Items

Algebraic notions of nontermination: Omega and divergence in idempotent semirings, Observations on the complexity of regular expression problems, The Böhm–Jacopini Theorem Is False, Propositionally, A survey of state vectors, On the Coalgebraic Theory of Kleene Algebra with Tests, Fixing Zeno gaps, A coalgebraic approach to Kleene algebra with tests, Program equivalence and context-free grammars, Synchronous Kleene algebra, Pair grammars, graph languages and string-to-graph translations, A note on infinite trees, On program schemata equivalence, \(L(A)=L(B)\)? decidability results from complete formal systems, Deciding Kleene algebra terms equivalence in Coq, A goal-directed decision procedure for hybrid PDL

Cites Work

• Two Complete Axiom Systems for the Algebra of Regular Events
• Programming Languages and Computers: A Unified Metatheory
• Unsolvability in 3 × 3 Matrices
• Algorithmic properties of structures
• On Ianov's Program Schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item