Solvability of equivalence problem for program machines

DOI10.1007/BF01069757MaRDI QIDQ3341899zbMATH OpenOpenAlexFDO

Authors A. Buda

Publication date 1982

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069757

zbMATH Keywords

calculations over a memorygeneralized finite automataprogram machinestree semigroup

Mathematics Subject Classification ID

Recommendations

• A case of insolubility of the problem of equivalence of programs
• scientific article; zbMATH DE number 862230
• Solvable problems for transformers with reversal-bounded counters
• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• scientific article; zbMATH DE number 3848637

Cites work

• Generalized sequential machine maps
• Some Remarks on Abstract Machines
• The equivalence problem for deterministic two-tape automata
• The theory of languages
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Cited in

(2)

• scientific article; zbMATH DE number 3883587 (Why is no real title available?)
• scientific article; zbMATH DE number 2102718 (Why is no real title available?)

This page was built for publication: Solvability of equivalence problem for program machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341899)