An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2008

An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet

Résumé

no abstract
Fichier non déposé

Dates et versions

hal-01215409 , version 1 (14-10-2015)

Identifiants

  • HAL Id : hal-01215409 , version 1

Citer

Alexis Bès. An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. Logical Methods in Computer Science, 2008, 4 (1:8). ⟨hal-01215409⟩

Collections

CNRS LACL UPEC
47 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More