Sciweavers

311 search results - page 17 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
LATA
2009
Springer
14 years 3 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
ATAL
2003
Springer
14 years 1 months ago
Programming agent deliberation: an approach illustrated using the 3APL language
This paper presents the specification of a programming language for implementing the deliberation cycle of cognitive agents. The mental attitudes of cognitive agents are assumed ...
Mehdi Dastani, Frank S. de Boer, Frank Dignum, Joh...
POPL
2009
ACM
14 years 9 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
ARTS
1997
Springer
14 years 25 days ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks
IJFCS
2006
130views more  IJFCS 2006»
13 years 8 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