1728 search results - page 18 / 346 » The Size of Power Automata |
SIAMCOMP
1998
13 years 8 months ago
1998
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
IFIPTCS
2000
14 years 1 days ago
2000
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
ICALP
2001
Springer
14 years 29 days ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...