Sciweavers

3443 search results - page 80 / 689
» More Algebras for Determiners
Sort
View
LICS
2006
IEEE
14 years 2 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
14 years 7 days ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
PARLE
1987
13 years 11 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
13 years 10 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
ACTAC
2006
101views more  ACTAC 2006»
13 years 8 months ago
Cycle Structure in Automata and the Holonomy Decomposition
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
Attila Egri-Nagy, Chrystopher L. Nehaniv