Finite-automaton aperiodicity is PSPACE-complete
Theoretical Computer Science
PSPACE-complete problems for subgroups of free groups and inverse finite automata
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Emptiness Problem for Intersections of Regular Languages
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Monadic Simultaneous Rigid E-Unification and Related Problems
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
| Hi-index | 0.00 |
In this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is PSPACE-complete and it is NP-complete for regular expressions of star height at most 1.