1705 search results - page 1 / 341 » Representing Constraints with Automata |
ACL
1997
13 years 6 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
ICCD
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
IANDC
2008
13 years 4 months ago
2008
Recently, attention has been given to formally characterize security policies that are enforceable by different kinds of security mechanisms. A very important research problem is ...