2 citations · 2 across the 1 of their papers we have counts for
5 papers
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…
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…
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…
A New Technique for Reachability of States in Concatenation Automata
Sylvie Davies
We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a…
Quotient Complexities of Atoms in Regular Ideal Languages
Janusz Brzozowski, Sylvie Davies
A (left) quotient of a language by a word is the language . The quotient complexity of a regular language is the number of quotients of ;…