Now showing items 1-4 of 4
Quotient Complexity Of Closed Languages
A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ...
Theory Of Atomata
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or ...
Syntactic Complexity Of R- And J-Trivial Regular Languages
(World Scientific Publishing, 2014-11-01)
The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ...
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
(Institute of Informatics: University of Szeged, 2014)
A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ...