Browsing Mathematics (Faculty of) by Author "Davies, Sylvie"
Now showing items 14 of 4

Algebraic Approaches to State Complexity of Regular Operations
Davies, Sylvie (University of Waterloo, 20191015)The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory of semigroups and monoids, many problems ... 
Most Complex Nonreturning Regular Languages
Brzozowski, Janusz; Davies, Sylvie (Springer, 20170703)A regular language L is nonreturning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derived upper bounds on the state complexity of ... 
Most Complex Regular Ideal Languages
Liu, Bo Yang Victor; Davies, Sylvie; Brzozowski, Janusz (Discrete Mathematics and Theoretical Computer Science, 20161017)A right ideal (left ideal, twosided ideal) is a nonempty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ... 
Quotient Complexities of Atoms in Regular Ideal Languages
Brzozowski, Janusz; Davies, Sylvie (Institute of Informatics: University of Szeged, 2015)A (left) quotient of a language L by a word w is the language w(1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ...