CORR
2011
Springer
13 years 6 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
MOC
2010
13 years 6 months ago
2010
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
DLT
2009
13 years 9 months ago
2009
Abstract. We consider algorithms for approximating context
CORR
2009
Springer
13 years 9 months ago
2009
Springer
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) "boxes&quo...
CORR
2009
Springer
13 years 9 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
IVC
2000
13 years 11 months ago
2000
Regular structures, flat and non-flat, are perceived as regular in a wide range of viewing angles and under varying illumination. In this papers, we exploit this simple observatio...
COMBINATORICS
2000
13 years 11 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
COMBINATORICS
2004
13 years 11 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
DEDS
2007
13 years 11 months ago
2007
— Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers ...