130 search results - page 14 / 26 » The Language Theory of Bounded Context-Switching |
APN
2009
Springer
14 years 2 months ago
2009
Springer
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
GG
2004
Springer
14 years 24 days ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
APIN
1998
13 years 7 months ago
1998
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...