Synchronized Product of Linear Bounded Machines
Abstract
This paper introduces a class of graphs associated to linear bounded machines. It is shown that this class is closed, up to observational equivalence, under synchronized product. The first-order theory of these graphs is investegated and shown to be undecidable. The latter result extends to any logic in which the existence of sinks may be stated.
Domains
Computer Science [cs]
Fichier principal
Chapter_Synchronized_Product_Of_Linear_Bounded_machines.pdf (192.16 Ko)
Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...