Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages
Abstract
We study the state complexity of binary operations on regular languages over different alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on L′m and Ln is mn, and that of product (concatenation) is m2n − 2n−1. In contrast to this, we show that if L′m and Ln are over different alphabets, the state complexity of union and symmetric difference is (m + 1)(n + 1), that of difference is mn + m, that of intersection is mn, and that of product is m2n + 2n−1. We also study unrestricted complexity of binary operations in the classes of regular right, left, and two-sided ideals, and derive tight upper bounds. The bounds for product of the unrestricted cases (with the bounds for the restricted cases in parentheses) are as follows: right ideals m + 2n−2 + 2n−1 + 1 (m + 2n−2); left ideals mn + m + n (m + n − 1); two-sided ideals m+2n (m+n−1). The state complexities of boolean operations on all three types of ideals are the same as those of arbitrary regular languages, whereas that is not the case if the alphabets of the arguments are the same. Finally, we update the known results about most complex regular, right-ideal, left-ideal, and two-sided-ideal languages to include the unrestricted cases.
Collections
Cite this version of the work
Janusz Brzozowski, Corwin Sinnamon
(2017).
Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages. UWSpace.
http://hdl.handle.net/10012/12498
Other formats
Related items
Showing items related by title, author, creator and subject.
-
Application of Complex Vectors and Complex Transformations in Solving Maxwell’s Equations
Saleh-Anaraki, Payam (University of Waterloo, 2011-01-20)Application and implication of using complex vectors and complex transformations in solutions of Maxwell’s equations is investigated. Complex vectors are used in complex plane waves and help to represent this type of waves ... -
Complexity of Classes of Structures
Knoll, Carolyn Alexis (University of Waterloo, 2013-08-28)The main theme of this thesis is studying classes of structures with respect to various measurements of complexity. We will briefly discuss the notion of computable dimension, while the breadth of the paper will focus on ... -
Building complex number words: How and when do children learn the meaning of multipliers.
Dale, Meghan (University of Waterloo, 2013-09-03)Number words or numerals are built using a compositional system, wherein a small number of words can be combined in multiple ways to represent many different numbers. Children not only have to learn the rules for combining ...