6 citations · 14 across the 5 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.FL2018★ 1 cited
A General Approach to State Complexity of Operations: Formalization and Limitations
Sylvie Davies
The state complexity of the result of a regular operation is often positively correlated with the number of distinct transformations induced by letters in the minimal deterministic…
cs.FL2018
State Complexity of Pattern Matching in Regular Languages
Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan
In a simple pattern matching problem one has a pattern and a text , which are words over a finite alphabet . One may ask whether occurs in , and if so, where? More…
cs.FL2018
Most Complex Deterministic Union-Free Regular Languages
Janusz A. Brzozowski, Sylvie Davies
A regular language is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a…