A Quasi-Linear Time Algorithm Deciding Whether Weak B\"uchi Automata Reading Vectors of Reals Recognize Saturated Languages

Abstract : This work considers weak deterministic B\"uchi automata reading encodings of non-negative $d$-vectors of reals in a fixed base. A saturated language is a language which contains all encoding of elements belonging to a set of $d$-vectors of reals. A Real Vector Automaton is an automaton which recognizes a saturated language. It is explained how to decide in quasi-linear time whether a minimal weak deterministic B\"uchi automaton is a Real Vector Automaton. The problem is solved both for the two standard encodings of vectors of numbers: the sequential encoding and the parallel encoding. This algorithm runs in linear time for minimal weak B\"uchi automata accepting set of reals. Finally, the same problem is also solved for parallel encoding of automata reading vectors of relative reals.
Type de document :
Pré-publication, Document de travail
2018
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01676719
Contributeur : Arthur Milchior <>
Soumis le : samedi 6 janvier 2018 - 06:03:10
Dernière modification le : dimanche 7 janvier 2018 - 01:07:36

Lien texte intégral

Identifiants

  • HAL Id : hal-01676719, version 1
  • ARXIV : 1703.04834

Collections

Citation

Arthur Milchior. A Quasi-Linear Time Algorithm Deciding Whether Weak B\"uchi Automata Reading Vectors of Reals Recognize Saturated Languages. 2018. 〈hal-01676719〉

Partager

Métriques

Consultations de la notice

49