On the state complexity of intersection of regular languages
- 1 June 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 22 (3) , 52-54
- https://doi.org/10.1145/126537.126543
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Intersection of Regular Languages and State ComplexityACM SIGACT News, 1991
- Some applications of a technique of Sakoda and SipserACM SIGACT News, 1990