227 search results - page 20 / 46 » P Systems and Finite Automata |
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
COLING
2000
13 years 11 months ago
2000
Results presented in this paper strongly support the notion that similarities as well as differences in language systems can be empirically investigated by looking into the lingui...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...