63 search results - page 1 / 13 » Complementation of Coalgebra Automata |
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
IANDC
2010
13 years 3 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
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...
FOSSACS
2012
Springer
12 years 7 days ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...