Operations on Automata with All States Final
Krist\'ina \v{C}evorov\'a, Galina Jir\'askov\'a, Peter, Mlyn\'ar\v{c}ik, Mat\'u\v{s} Palmovsk\'y, Juraj \v{S}ebej
TL;DR
This paper investigates the computational complexity of fundamental regular language operations on prefix-closed languages represented by automata where all states are final, providing tight bounds on their state complexities.
Contribution
It establishes precise bounds on the state complexity of key operations on prefix-closed languages represented by automata with all states final.
Findings
Tight bounds on complement and intersection complexities.
Precise complexity bounds for union, concatenation, star, and reversal.
Focus on prefix-closed languages with all states final automata.
Abstract
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both incomplete and nondeterministic state complexity of complement, intersection, union, concatenation, star, and reversal on prefix-closed languages.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.