Synchronizing Data Words for Register Automata

DOI10.4230/LIPIcs.MFCS.2016.15zbMath1398.68294OpenAlexW2963951373MaRDI QIDQ4608573

Mahsa Shirmohammadi, Parvaneh Babari, Karin Quaas

Publication date: 21 March 2018

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2016/6499/

zbMATH Keywords

data wordsregister automataAckermann-completenessbounded universalityregular-like expressions with squaringsynchronizing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Synchronization of Parikh automata ⋮ The complexity of synchronizing Markov decision processes

This page was built for publication: Synchronizing Data Words for Register Automata