2465 search results - page 56 / 493 » Automata on Linear Orderings |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
CADE
2001
Springer
14 years 9 days ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
PTS
2003
13 years 9 months ago
2003
We present a framework for property testing where a partially ordered execution trace of a distributed system is modeled by a collection of communicating automata. We prove that th...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this paper we present a parameterized reduction technique for non-linear systems. Our approach combines an existing non-parameterized trajectory piecewise linear method for ...
ERSHOV
1989
Springer
13 years 12 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...