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.
Index Terms—Alternating finite automata, regular languages, shuffle, state complexity.
Kavitha Joseph was with Anna University, Chennai, INDIA. She is nowwith the Department of Mathematics,
CMR Institute of Technology, Bangalore, INDIA.
(Author e-mail: kavijoseph_cmrit@rediffmail.com).
Cite: Kavitha Joseph, Member, CSI, "State Complexity of Shuffle and Intersection Combined with Complement," International Journal of Computer Theory and Engineering vol. 1, no. 5, pp. 577-580, 2009.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
