| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426272 | Information and Computation | 2008 | 9 Pages |
Abstract
We study the state complexity of combined operations on regular languages. Each of the combined operations is a basic operation combined with reversal. We show that their state complexities are all very different from the compositions of state complexities of individual operations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
