1728 search results - page 20 / 346 » The Size of Power Automata |
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 ...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
IJFCS
2007
13 years 8 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
JAC
2008
13 years 10 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...