495 search results - page 12 / 99 » Automata and differentiable words |
CONCUR
2001
Springer
14 years 7 days ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
MFCS
2001
Springer
14 years 5 days ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.
JAC
2008
13 years 9 months ago
2008
In this paper, two-dimensional cellular automata as one-dimensional language recognizers are considered. Following the approach of M. Delorme and J. Mazoyer to embed one-dimensiona...