| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437214 | Theoretical Computer Science | 2012 | 10 Pages |
Abstract
In this paper, we continue our study on state complexity of combined operations. We study the state complexities of , , , and for regular languages Li, 1≤i≤k. We obtain the exact bounds for these combined operations and show that the bounds are different from the mathematical compositions of the state complexities of their component individual operations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
