State Complexity of Shuffle and Intersection Combined with Complement - Volume 1, Number 5 (Dec. 2009) - IJCTE
  • Aug 06, 2018 News!Vol.9, No.1-Vol.9, No.4 have been indexed by EI (Inspec).   [Click]
  • Jul 12, 2018 News!Vol.10, No.3 has been published with online version.   [Click]
  • Aug 06, 2018 News!Vol.8, No.6  has been indexed by EI (Inspec).   [Click]
General Information
Editor-in-chief
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2009 Vol.1(5): 577-580 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2009.V1.92

State Complexity of Shuffle and Intersection Combined with Complement

Kavitha Joseph

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).

[PDF]

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-2018. International Journal of Computer Theory and Engineering. All rights reserved.
E-mail: ijcte@iacsitp.com