Now showing items 1-3 of 3
Complexity of Proper Prefix-Convex Regular Languages
A language L over an alphabet Σ is prefix-convex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ...
Most Complex Non-returning Regular Languages
A regular language L 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á derived upper bounds on the state complexity of ...
Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages
(Institut für Informatik, 2017-08-27)
We study the state complexity of binary operations on regular languages over diﬀerent alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, ...