New answers tagged regular-language
6
votes
Accepted
Existence of injective length-preserving rational function to a smaller alphabet
It turns out the answer is "no": in [2] the authors show that a regular language $L$ exists with density $\rho_L(n) \leq |B|^n$ such that no regular language over $B$ has the same density; ...
- 677
Top 50 recent answers are included