Sciweavers

349 search results - page 4 / 70
» The Finite and the Infinite
Sort
View
JFPLC
2000
13 years 8 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
CPC
2006
132views more  CPC 2006»
13 years 7 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
FSTTCS
2010
Springer
13 years 5 months ago
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
Sven Schewe
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
13 years 9 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
IJAC
2008
116views more  IJAC 2008»
13 years 7 months ago
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
Laurent Bartholdi, Bettina Eick, René Hartu...