Finite automata and unary languages
Theoretical Computer Science
Tally versions of the Savitch and Immerman-Szelepcse´nyi theorems for sublogarithmic space
SIAM Journal on Computing
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Automaticity II: descriptional complexity in the unary case
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Optimal Simulations Between Unary Automata
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State Complexity and Jacobsthal's Function
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
State Complexity and Jacobsthal's Function
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
State complexity of prefix, suffix, bifix and infix operators on regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
In this paper we study the costs, in terms of states, of some basic operations on regular languages, in the unary case, namely in the case of languages defined over a one letter alphabet. In particular, we concentrate our attention on the concatenation. The costs, which are proved to be tight, are given by explicitly indicating the number of states in the noncyclic and in the cyclic parts of the resulting automata.