Solvability of equivalence problem for program machines

DOI10.1007/BF01069757zbMath0549.68042OpenAlexW1965919129MaRDI QIDQ3341899

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

program machinesgeneralized finite automatacalculations over a memorytree semigroup

Mathematics Subject Classification ID

Cites Work

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

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