Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Synchronizing Data Words for Register Automata

Synchronizing Data Words for Register Automata Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA to a single state? For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data from the infinite data domain is sufficient to synchronize. We show that the synchronization problem for DRAs is in general PSPACE-complete, and it is NLOGSPACE-complete for 1-DRAs. For nondeterministic RAs (NRAs), we show that Ackermann(n) distinct data (where n is the size of the RA) might be necessary to synchronize. The synchronization problem for NRAs is in general undecidable; however, we establish Ackermann-completeness of the problem for 1-NRAs. Another main result is the NEXPTIME-completeness of the length-bounded synchronization problem for NRAs, where a bound on the length of the synchronizing data word, written in binary, is given. A variant of this last construction allows to prove that the length-bounded universality problem for NRAs is co-NEXPTIME-complete. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Synchronizing Data Words for Register Automata

Download PDF
27 pages

Loading next page...
 
/lp/association-for-computing-machinery/synchronizing-data-words-for-register-automata-BXUtxEhOrE

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2019 ACM
ISSN
1529-3785
eISSN
1557-945X
DOI
10.1145/3309760
Publisher site
See Article on Publisher Site

Abstract

Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA to a single state? For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data from the infinite data domain is sufficient to synchronize. We show that the synchronization problem for DRAs is in general PSPACE-complete, and it is NLOGSPACE-complete for 1-DRAs. For nondeterministic RAs (NRAs), we show that Ackermann(n) distinct data (where n is the size of the RA) might be necessary to synchronize. The synchronization problem for NRAs is in general undecidable; however, we establish Ackermann-completeness of the problem for 1-NRAs. Another main result is the NEXPTIME-completeness of the length-bounded synchronization problem for NRAs, where a bound on the length of the synchronizing data word, written in binary, is given. A variant of this last construction allows to prove that the length-bounded universality problem for NRAs is co-NEXPTIME-complete.

Journal

ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery

Published: Mar 27, 2019

Keywords: Register automata

References

  • Survey of graph database models
    Angles, Renzo; Gutierrez, Claudio
  • Synchronizing data words for register automata
    Babari, Parvaneh; Quaas, Karin; Shirmohammadi, Mahsa
  • Expressive languages for path queries over graph-structured data
    Barceló, Pablo; Libkin, Leonid; Lin, Anthony W.; Wood, Peter T.
  • DNA molecule provides a computing machine with both data and fuel
    Benenson, Y.; Adar, R.; Paz-Elizur, T.; Livneh, Z.; Shapiro, E.
  • Two-variable logic on words with data
    Bojańczyk, Mikołaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc; David, Claire
  • XPath evaluation in linear time
    Bojanczyk, Mikolaj; Parys, Pawel
  • Rewriting systems with data
    Bouajjani, Ahmed; Habermehl, Peter; Jurski, Yan; Sighireanu, Mihaela
  • An algebraic approach to data languages and timed languages
    Bouyer, Patricia; Petit, Antoine; Thérien, Denis
  • Poznámka k homogénnym experimentom s konečnými automatmi
    Černý, Ján
  • Synchronizing automata over nested words
    Chistikov, Dmitry; Martyugin, Pavel; Shirmohammadi, Mahsa
  • Timed pushdown automata revisited
    Clemente, Lorenzo; Lasota, Slawomir
  • LTL with the freeze quantifier and register automata
    Demri, Stéphane; Lazic, Ranko
  • On the freeze quantifier in Constraint LTL: Decidability and complexity
    Demri, Stéphane; Lazic, Ranko; Nowak, David
  • Model checking memoryful linear-time logics over one-counter automata
    Demri, Stéphane; Lazic, Ranko; Sangnier, Arnaud
  • Synchronizing words for weighted and timed automata
    Doyen, Laurent; Juhl, Line; Larsen, Kim Guldstrand; Markey, Nicolas; Shirmohammadi, Mahsa
  • Infinite synchronizing words for probabilistic automata
    Doyen, Laurent; Massart, Thierry; Shirmohammadi, Mahsa
  • Satisfiability of downward XPath with data equality tests
    Figueira, Diego
  • Alternating register automata on finite words and trees
    Figueira, Diego
  • Ackermannian and primitive-recursive bounds with Dickson’s lemma
    Figueira, Diego; Figueira, Santiago; Schmitz, Sylvain; Schnoebelen, Philippe
  • Finite-memory automata
    Kaminski, Michael; Francez, Nissim
  • Polynomial time decidability of weighted synchronization under partial observability
    Kretínský, Jan; Larsen, Kim Guldstrand; Laursen, Simon; Srba, Jirí
  • Synchronizing strategies under partial observability
    Larsen, Kim Guldstrand; Laursen, Simon; Srba, Jirí
  • Temporal logic with predicate lambda-abstraction
    Lisitsa, Alexei; Potapov, Igor
  • Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
    Martyugin, Pavel V.
  • Finite state machines for strings over infinite alphabets
    Neven, Frank; Schwentick, Thomas; Vianu, Victor
  • Sur les mots synthronisants dans un automate fini
    Pin, Jean-Eric
  • Intractability of decision problems for finite-memory automata
    Sakamoto, Hiroshi; Ikeda, Daisuke
  • Complexity hierarchies beyond elementary
    Schmitz, Sylvain
  • Qualitative Analysis of Probabilistic Synchronizing Systems
    Shirmohammadi, Mahsa
  • Fresh-register automata
    Tzevelekos, Nikos
  • Synchronizing automata and the cerny conjecture
    Volkov, Mikhail V.