303 search results - page 3 / 61 » Automata on Gauss Words |
JUCS
2007
13 years 7 months ago
2007
: This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some ...
CISIS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In this paper, we integrate the traditional finitestate automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrat...
LATIN
2004
Springer
14 years 21 days ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...