Vectorial Languages and Linear Temporal Logic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Vectorial Languages and Linear Temporal Logic

Résumé

Determining for a given deterministic complete automaton the sequence of visited states while reading a given word is the core of important problems with automata-based solutions, such as approximate string matching. The main difficulty is to do this computation efficiently, especially when dealing with very large texts. Considering words as vectors and working on them using vectorial (parallel) operations allows to solve the problem faster than in linear time using sequential computations. In this paper, we show first that the set of vectorial operations needed by an algorithm representing a given automaton depends only on the language accepted by the automaton. We give precise characterizations of vectorial algorithms for star-free, solvable and regular languages in terms of the vectorial operations allowed. We also consider classes of languages associated with restricted sets of vectorial operations and relate them with languages defined by fragments of linear temporal logic. Finally, we consider the converse problem of constructing an automaton from a given vectorial algorithm. As a byproduct, we show that the satisfiability problem for some extensions of linear-time temporal logic characterizing solvable and regular languages is PSPACE-complete.
Fichier principal
Vignette du fichier
final.pdf (130.66 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00012656 , version 1 (26-10-2005)

Identifiants

  • HAL Id : hal-00012656 , version 1

Citer

Olivier Serre. Vectorial Languages and Linear Temporal Logic. 2nd IFIP International Conference Theoretical Computer Science (TCS@2002), 2002, Montreal, Canada. pp.576-587. ⟨hal-00012656⟩
80 Consultations
96 Téléchargements

Partager

Gmail Facebook X LinkedIn More