@inproceedings{babari_et_al:LIPIcs:2016:6499,
Address = {Dagstuhl, Germany},
Annote = {Keywords: data words, register automata, synchronizing problem, Ackermann-completeness, bounded universality, regular-like expressions with squaring},
Author = {Babari, Parvaneh and Quaas, Karin and Shirmohammadi, Mahsa},
BookTitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
Editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
File = {Synchronizing Data Words for Register Automata - Babari, Quaas, Shirmohammadi (0) (0) - a - a - f.pdf},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
Keywords = {citesme!},
Pages = {15:1--15:15},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Synchronizing Data Words for Register Automata}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6499},
Volume = {58},
Year = {2016},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/6499},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.15},
date-added = {2016-08-25 06:28:08 +0000},
date-modified = {2016-08-25 06:28:42 +0000},
urn = {urn:nbn:de:0030-drops-64996},
doi = {10.4230/LIPIcs.MFCS.2016.15}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A