CORR
2009
Springer
13 years 9 months ago
2009
Springer
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems...
CORR
2009
Springer
13 years 9 months ago
2009
Springer
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their g...
CORR
2009
Springer
13 years 9 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
CORR
2009
Springer
13 years 9 months ago
2009
Springer
CORR
2009
Springer
13 years 9 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
CORR
2009
Springer
14 years 4 months ago
2009
Springer