Sciweavers

FUIN
2002
60views more  FUIN 2002»
14 years 6 days ago
One-Visit Caterpillar Tree Automata
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
FUIN
2002
123views more  FUIN 2002»
14 years 6 days ago
Learning Rough Set Classifiers from Gene Expressions and Clinical Data
Biological research is currently undergoing a revolution. With the advent of microarray technology the behavior of thousands of genes can be measured simultaneously. This capabilit...
Herman Midelfart, Henryk Jan Komorowski, Kristin N...
FUIN
2002
89views more  FUIN 2002»
14 years 6 days ago
Process Algebra with Nonstandard Timing
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with t...
Kees Middelburg
FUIN
2002
94views more  FUIN 2002»
14 years 6 days ago
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of pre...
Hanna Klaudel, Franck Pommereau
FUIN
2002
63views more  FUIN 2002»
14 years 6 days ago
Probabilistic Cluster Unfoldings
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
Stefan Haar
FUIN
2002
132views more  FUIN 2002»
14 years 6 days ago
RIONA: A New Classification System Combining Rule Induction and Instance-Based Learning
The article describes a method combining two widely-used empirical approaches to learning from examples: rule induction and instance-based learning. In our algorithm (RIONA) decisi...
Grzegorz Góra, Arkadiusz Wojna
FUIN
2002
117views more  FUIN 2002»
14 years 6 days ago
A Comparative Study of Some Generalized Rough Approximations
In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive rela...
Anna Gomolinska
FUIN
2002
90views more  FUIN 2002»
14 years 6 days ago
A Direct Construction of a Universal P System
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
FUIN
2002
107views more  FUIN 2002»
14 years 6 days ago
Comparing Refinements for Failure and Bisimulation Semantics
Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled tran...
Rik Eshuis, Maarten M. Fokkinga