doi: 10.7763/IJCTE.2009.V1.92
State Complexity of Shuffle and Intersection Combined with Complement
Kavitha Joseph1,2
- 1Anna University, Chennai, India.
- 2Department of Mathematics, CMR Institute of Technology, Bangalore, India.
Abstract
This paper investigates the state complexity of combined operations on regular languages. In particular it investigates the state complexity of shuffle of complement and the intersection of complement of two regular languages represented by alternating finite automata.
Keywords
- Alternating finite automata
- regular languages
- shuffle
- state complexity
How to Cite
Kavitha Joseph, "State Complexity of Shuffle and Intersection Combined with Complement," International Journal of Computer Theory and Engineering, vol. 1, no. 5, pp. 577-580, 2009. https://doi.org/10.7763/IJCTE.2009.V1.92
Copyright & License
Copyright © 2009 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).