Sciweavers

IJFCS
2007
105views more  IJFCS 2007»
13 years 4 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
IJFCS
2007
100views more  IJFCS 2007»
13 years 4 months ago
On the Power of Deterministic and Sequential Communicating P Systems
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in...
Ludek Cienciala, Lucie Ciencialová, Pierlui...
IJFCS
2007
60views more  IJFCS 2007»
13 years 4 months ago
The Structure of Factor Oracles
Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
IJFCS
2007
93views more  IJFCS 2007»
13 years 4 months ago
Modelling and Analysis of PKI-Based Systems Using Process Calculi
In this technical report, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retriev...
Benjamin Aziz, Geoff Hamilton
IJFCS
2007
53views more  IJFCS 2007»
13 years 4 months ago
Spiking Neural P Systems: an Early Survey
Gheorghe Paun, Mario J. Pérez-Jiméne...
IJFCS
2007
75views more  IJFCS 2007»
13 years 4 months ago
Binary amiable Words
Adrian Atanasiu
IJFCS
2007
85views more  IJFCS 2007»
13 years 4 months ago
Fusing Loopless Algorithms for Combinatorial Generation
Tadao Takaoka, Stephen Violich
IJFCS
2007
58views more  IJFCS 2007»
13 years 4 months ago
LP Distance and Equivalence of Probabilistic Automata
Corinna Cortes, Mehryar Mohri, Ashish Rastogi
IJFCS
2007
93views more  IJFCS 2007»
13 years 4 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
IJFCS
2007
80views more  IJFCS 2007»
13 years 4 months ago
Bisimulation Minimization of Tree Automata
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka...