The state complexities of some basic operations on regular languages
Theoretical Computer Science
Numeration systems, linear recurrences, and regular sets
Information and Computation
Discrete Applied Mathematics
Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
On fairness of many-dimensional trajectories
Journal of Automata, Languages and Combinatorics
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Characterizing Regular Languages with Polynomial Densities
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Shuffle on Trajectories: The Schützenberger Product and Related Operations
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Formal and natural computing
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
State complexity of combined operations for suffix-free regular languages
Theoretical Computer Science
| Hi-index | 0.00 |
It is easy to get an upper bound for the state complexity of shuffle on trajectories that generalizes the bound for unrestricted shuffle. We establish improved bounds for slender trajectories, that is, trajectories which have only a constant number of strings of a given length. For trajectories with USL-index 1 (or 1-thin trajectories, those with only one string of each length) we obtain an asymptotically optimal lower bound when the state complexity of the trajectory grows with respect to the state complexity of the component languages. Some estimations are improved by considering nondeterministic state complexity.