423 search results - page 4 / 85 » The Generalization of Generalized Automata: Expression Autom... |
WIA
2009
Springer
14 years 3 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
CSL
2008
Springer
13 years 10 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expr...