Browsing Mathematics (Faculty of) by Subject "Reversal"
Now showing items 1-2 of 2
-
Most Complex Non-returning Regular Languages
(Springer, 2017-07-03)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 ... -
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
(Elsevier, 2012-08-31)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ...