On the decidability of the equivalence problem for orthogonal sequential programs

DOI10.1023/A:1009954232570zbMath0968.68099OpenAlexW1600563181MaRDI QIDQ1592932

Vladimir A. Zakharov

Publication date: 16 January 2001

Published in: Grammars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009954232570

zbMATH Keywords

orthogonal substitutions

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Program equivalence checking by two-tape automata

This page was built for publication: On the decidability of the equivalence problem for orthogonal sequential programs