IMSCCS
2006
IEEE
13 years 10 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
CISIS
2007
IEEE
13 years 11 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...
ICTAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...