Computer Science > Formal Languages and Automata Theory
[Submitted on 26 Jun 2020 (v1), last revised 16 Aug 2021 (this version, v3)]
Title:State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints
View PDFAbstract:We investigate the state complexity of the permutation operation, or the commutative closure, on Alphabetical Pattern Constraints (APC). This class corresponds to level $3/2$ of the Straubing-Th{é}rien Hierarchy and includes the finite, the piecewise-testable, or $\mathcal J$-trivial, and the $\mathcal R$-trivial and $\mathcal L$-trivial languages. We give a sharp state complexity bound expressed in terms of the longest strings in the unary projection languages of an associated finite language and which is already sharp for the subclass of finite languages. Additionally, for two subclasses, we give sharp bounds expressed in terms of the size of a recognizing input automaton and the size of the alphabet. Lastly, we investigate the inclusion and universality problem on APCs up to permutational equivalence, two problems known to be PSPACE-complete on APCs even for fixed alphabets in general, and show them to be decidable in polynomial time for fixed alphabets in this case.
Submission history
From: Stefan Hoffmann [view email][v1] Fri, 26 Jun 2020 19:10:22 UTC (54 KB)
[v2] Sun, 14 Mar 2021 13:53:58 UTC (52 KB)
[v3] Mon, 16 Aug 2021 15:53:15 UTC (61 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.