On the complexity and decidability of some problems involving shuffle

DOI10.1016/j.ic.2017.09.002zbMath1390.68392arXiv1606.01199MaRDI QIDQ1706154

Oscar H. Ibarra, Ian McQuillan, Joey Eremondi

Publication date: 21 March 2018

Published in: Information and Computation, Descriptional Complexity of Formal Systems (Search for Journal in Brave)

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

zbMATH Keywords

shuffle; determinism; strings; commutativity; counter machines; reversal-bounds; pushdown machines; automata and logic

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

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