| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438335 | Theoretical Computer Science | 2007 | 13 Pages |
Abstract
We study the state complexity of combined operations. Two particular combined operations are studied: star of union and star of intersection. It is shown that the state complexity of a combined operation is not necessarily similar to the combination of the individual state complexities of the participating operations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
