. . .

About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors

Departments:
- Image Processing and Computer Graphics
- Technical Informatics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence

[University of Szeged]
Research>>> Acta Cybernetica>>> Previous Volumes>>> Magyarul

Regular expression star-freeness is PSPACE-complete

 

 

 


László Bernátsky 1 2

 


Abstract

 

 It is proved that the problem of deciding if a regular expression denotes a star-free language is PSPACE -complete. The paper also includes a new proof of the PSPACE -completeness of the finite automaton aperiodicity problem.


Footnotes:

 

  1 Department of Computer Science, Attila József University, 6720 Szeged, Hungary, E-mail: benny@inf.u-szeged.hu

  2 Supported in part by grant no. T7383 of the National Foundation of Scientific Research of Hungary

Webmaster:webmaster@inf.u-szeged.hu