Sciweavers

31 search results - page 2 / 7
» Involutively Bordered Words
Sort
View
ATS
2003
IEEE
126views Hardware» more  ATS 2003»
13 years 11 months ago
Analyzing the Impact of Process Variations on DRAM Testing Using Border Resistance Traces
Abstract: As a result of variations in the fabrication process, different memory components are produced with different operational characteristics, a situation that complicates th...
Zaid Al-Ars, A. J. van de Goor
ENTCS
2006
141views more  ENTCS 2006»
13 years 5 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
JACM
2007
92views more  JACM 2007»
13 years 5 months ago
Periodicity and unbordered words: A proof of the extended duval conjecture
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word...
Tero Harju, Dirk Nowotka
MFCS
1998
Springer
13 years 10 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
CGVR
2006
13 years 7 months ago
A Bipolar Model for Region Simplification
In this paper we introduce an algorithm for simplifying a 2D discrete region. This algorithm is based on a bipolar model of regions. Given a discrete region, we cut its Voronoi di...
Yuqing Song, Jie Shen, David Yoon