423 search results - page 22 / 85 » The Generalization of Generalized Automata: Expression Autom... |
DLT
2009
13 years 6 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and...
TON
2012
11 years 11 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
FOSSACS
2011
Springer
13 years 6 days ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
WOSP
2010
ACM
14 years 3 months ago
2010
ACM
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...