Ran Ben Basat
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Formal Lang.×1Complexity×1Algorithms×1Combinatorics×1
Research Timeline
2026
Breaking the $4^k$ Barrier for the $k$-Distinct Language
This paper presents a new nondeterministic finite automaton (NFA) for recognizing repetition-free words over a given alphabet, improving on the previous construction.
Highlighted terms show continued research focus across papers