Sciweavers

204 search results - page 12 / 41
» The Language, the Expression, and the (Small) Automaton
Sort
View
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 7 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
CC
2000
Springer
105views System Software» more  CC 2000»
13 years 12 months ago
MATOU: An Implementation of Mode-Automata
Mode-Automata have been proposed in [11]. They introduce, in the domain-specific data-flow language Lustre for reactive systems, a new construct devoted to the expression of runn...
Florence Maraninchi, Yann Rémond, Yannick R...
ESOP
1998
Springer
13 years 11 months ago
Mode-Automata: About Modes and States for Reactive Systems
Abstract. In the eld of reactive system programming, data ow synchronous languages like Lustre BCH+85,CHPP87 or Signal GBBG85 o er a syntax similar to block-diagrams, and can be e ...
Florence Maraninchi, Yann Rémond
IJFCS
2006
130views more  IJFCS 2006»
13 years 7 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
ICALP
2010
Springer
14 years 9 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema