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

Alexis Bès 1
1 LACL - Laboratoire d'Algorithmique Complexité et Logique
Abstract : no abstract
Document type :
Journal articles
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-01215409
Contributor : Alexis Bès <>
Submitted on : Wednesday, October 14, 2015 - 10:49:40 AM
Last modification on : Thursday, January 11, 2018 - 6:19:29 AM

Identifiers

  • HAL Id : hal-01215409, version 1

Collections

LACL | INSMI | UPEC-UPEM

Citation

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, Logical Methods in Computer Science Association, 2008, 4 (1:8). 〈hal-01215409〉

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

68

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD