141 search results - page 21 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
CAV
1999
Springer
14 years 26 days ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
SCALESPACE
1997
Springer
14 years 21 days ago
1997
Springer
We developed a method that transforms a polygonal representation of an object into a voxel representation on a 3D regular grid. By applying scale-space theory we derived expression...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...