Publication:4608573

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

Karin Quaas, Mahsa Shirmohammadi, Parvaneh Babari

Publication date: 21 March 2018

zbMATH Keywords

data words; register automata; Ackermann-completeness; bounded universality; regular-like expressions with squaring; synchronizing problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)