Sciweavers

CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 5 days ago
Isomorphism of regular trees and words
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...
Markus Lohrey, Christian Mathissen
MOC
2010
13 years 13 days ago
Portrait of the four regular super-exponentials to base sqrt(2)
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)). ...
Dmitrii Kouznetsov, Henryk Trappmann
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 20 days ago
On the regularity of iterated hairpin completion of a single word
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...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
DLT
2009
13 years 3 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
CORR
2009
Springer
137views Education» more  CORR 2009»
13 years 3 months ago
Choreographies with Secure Boxes and Compromised Principals
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) "boxes&quo...
Marco Carbone, Joshua D. Guttman
CORR
2009
Springer
99views Education» more  CORR 2009»
13 years 3 months ago
Quotient Complexity of Regular Languages
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...
Janusz A. Brzozowski
IVC
2000
93views more  IVC 2000»
13 years 5 months ago
Pattern regularity as a visual key
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...
Dmitry Chetverikov
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
13 years 5 months ago
The Strongly Regular (40, 12, 2, 4) Graphs
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...
Edward Spence
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 5 months ago
Short Cycles in Random Regular Graphs
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...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
DEDS
2007
109views more  DEDS 2007»
13 years 5 months ago
Concurrent Secrets
— 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 ...
Eric Badouel, Marek A. Bednarczyk, Andrzej M. Borz...