Thue specifications, infinite graphs and synchronized product - Université de La Réunion Access content directly
Journal Articles Fundamenta Informaticae Year : 2000

Thue specifications, infinite graphs and synchronized product

Abstract

This paper presents some formal verification-oriented results about the class of graphs associated with Thue specifications. It is shown that this class is closed, up to isomorphism, under synchronized product. It is also established that every rational graph with no edge labeled by the empty word is isomorphic to the graph of a Thue specification. A consequence of this result is that the first-order theory of the graphs of Thue specifications is undecidable. Connections between graphs of Thue specifications and those of Turing machines are finally investigated. The main result is that the graph of each Thue specification is observationally equivalent to that of a Turing machine but the reverse does not hold.
Fichier principal
Vignette du fichier
Thue_specifications_infinite_graphs_synchronized_product_hal.pdf (1.34 Mo) Télécharger le fichier

Dates and versions

hal-01915145 , version 1 (07-11-2018)

Identifiers

  • HAL Id : hal-01915145 , version 1

Cite

Etienne Payet. Thue specifications, infinite graphs and synchronized product. Fundamenta Informaticae, 2000, 44 (3), pp.265-290. ⟨hal-01915145⟩
38 View
27 Download

Share

Gmail Mastodon Facebook X LinkedIn More