2 citations · 2 across the 1 of their papers we have counts for
4 papers · 1 filter
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…
State Complexity of Reversals of Deterministic Finite Automata with Output
Sylvie Davies
We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rathe…
Primitivity, Uniform Minimality and State Complexity of Boolean Operations
Sylvie Davies
A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is replaced by a non-empty proper subset of the state set.…
Most Complex Non-Returning Regular Languages
Janusz A. Brzozowski, Sylvie Davies
A regular language is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derive…