Synchronizing Data Words for Register Automata

DOI10.1145/3309760zbMath1433.68199arXiv1710.02329OpenAlexW2926815817WikidataQ128155921 ScholiaQ128155921MaRDI QIDQ5222876

Karin Quaas, Mahsa Shirmohammadi

Publication date: 4 July 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.02329

zbMATH Keywords

synchronization problemdata wordsregister automatabounded universality

Mathematics Subject Classification ID

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

Related Items (3)

Synchronization of Parikh automata ⋮ Synchronizing words under \textsf{LTL} constraints ⋮ Synchronizing deterministic push-down automata can be really hard

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