The Complexity of Downward Closure Comparisons

DOI10.4230/LIPIcs.ICALP.2016.123zbMath1388.68183arXiv1605.03149OpenAlexW2963604037MaRDI QIDQ4598265

Georg Zetzsche

Publication date: 19 December 2017

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

zbMATH Keywords

complexityequivalenceinclusiondownward closures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Scattered Factor-Universality of Words, Cost Automata, Safe Schemes, and Downward Closures, Absent Subsequences in Words, Unboundedness problems for machines with reversal-bounded counters, Ranking and Unranking k-Subsequence Universal Words, Longest Common Subsequence with Gap Constraints, Subsequences in bounded ranges: matching and analysis problems, Existential Definability over the Subword Ordering, Absent subsequences in words, Unnamed Item, Unnamed Item, The Complexity of the Diagonal Problem for Recursion Schemes