The state complexity of L2 and Lk
Narad Rampersad
Abstract
We show that if M is a DFA with n states over an arbitrary alphabet and L = L(M), then the worst-case state complexity of L2 is n*2n - 2n-1. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of Lk is kn-k+1 for all k >= 2.
Create a lesson
Related papers
Semidirect sums of tensors and the matrix multiplication exponent
Baitian Li
On the Role of Geometry in Solving Variational Inequalities
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
The Complexity of ReLU Network Synthesis from a Parameter Multiset
Dimitrios Myrisiotis
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis
A Circuit Complexity Trichotomy For Regular Languages
Stefan Göller, Amaldev Manuel
Determinant boundaries and gaps in determinantal complexity
Karthik Sheshadri