Intersection and union of regular languages and state complexity
- 28 September 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 43 (4) , 185-190
- https://doi.org/10.1016/0020-0190(92)90198-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Partial orders on words, minimal elements of regular languages, and state complexityTheoretical Computer Science, 1993
- On the state complexity of intersection of regular languagesACM SIGACT News, 1991
- Some comments on a recent note by RavikumarACM SIGACT News, 1991
- Some applications of a technique of Sakoda and SipserACM SIGACT News, 1990
- Succinct representation of regular languages by boolean automataTheoretical Computer Science, 1981
- AlternationJournal of the ACM, 1981