Sciweavers

18 search results - page 2 / 4
» Mealy multiset automata
Sort
View
ENTCS
2006
161views more  ENTCS 2006»
13 years 4 months ago
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
Jan J. M. M. Rutten
CISIS
2007
IEEE
13 years 11 months ago
P Systems and Finite Automata
Abstract— In this paper, we integrate the traditional finitestate automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrat...
Xian Xu
FASE
2008
Springer
13 years 6 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
NC
2010
159views Neural Networks» more  NC 2010»
13 years 3 months ago
Automata and processes on multisets of communicating objects
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
Linmin Yang, Yong Wang, Zhe Dang
CSL
2007
Springer
13 years 8 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...