Thesiss

3 works - Thesiss.

"3" Result

The theories of formal language and automata are fundamental in several areas of computer science. During decades of development, these theories have been stretched out and reach many branches and application contexts, ranging from lexical analysis, natural language processing, …

We consider a natural extension to the definition of M-automata which allows the automaton to make use of more of the structure of the monoid M, and by removing the reliance on an identity element, allows the definition of S-automata for S an arbitrary semigroup. In the case of …