TCS 2008 | Sciweavers

39

click to vote

TCS
2008

113views Theoretical Computer Science» more TCS 2008»

Fault-free Hamiltonian cycles in twisted cubes with conditional link faults

13 years 10 months ago

Download ir.lib.au.edu.tw

Jung-Sheng Fu

claim paper

Read More »

43

click to vote

TCS
2008

143views Theoretical Computer Science» more TCS 2008»

Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids

13 years 10 months ago

Download www-igm.univ-mlv.fr

We introduce an extension of the derivatives of rational expressions to expressions denoting formal power series over partially commuting variables. The expressions are purely non...

Jean Berstel, Christophe Reutenauer

claim paper

Read More »

33

click to vote

TCS
2008

137views Theoretical Computer Science» more TCS 2008»

Computation of distances for regular and context-free probabilistic languages

13 years 11 months ago

Download www.cs.st-andrews.ac.uk

Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...

Mark-Jan Nederhof, Giorgio Satta

claim paper

Read More »

54

click to vote

TCS
2008

229views Theoretical Computer Science» more TCS 2008»

Algorithms for subsequence combinatorics

13 years 11 months ago

Download compalg.inf.elte.hu

A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...

Cees H. Elzinga, Sven Rahmann, Hui Wang

claim paper

Read More »

33

click to vote

TCS
2008

111views Theoretical Computer Science» more TCS 2008»

Rational subsets of partially reversible monoids

13 years 11 months ago

Download cmup.fc.up.pt

Pedro V. Silva

claim paper

Read More »

24

click to vote

TCS
2008

107views Theoretical Computer Science» more TCS 2008»

Generating all permutations by context-free grammars in Greibach normal form

13 years 11 months ago

Download eprints.eemcs.utwente.nl

Peter R. J. Asveld

claim paper

Read More »

40

click to vote

TCS
2008

100views Theoretical Computer Science» more TCS 2008»

Structural Presburger digit vector automata

13 years 11 months ago

Download hal.archives-ouvertes.fr

Jérôme Leroux

claim paper

Read More »

38

click to vote

TCS
2008

91views Theoretical Computer Science» more TCS 2008»

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree

13 years 11 months ago

Download hal-lirmm.ccsd.cnrs.fr

1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...

Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...

claim paper

Read More »

34

click to vote

TCS
2008

105views Theoretical Computer Science» more TCS 2008»

Paths and trails in edge-colored graphs

13 years 11 months ago

Download www.lri.fr

This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...

A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...

claim paper

Read More »

39

click to vote

TCS
2008

94views Theoretical Computer Science» more TCS 2008»

Quasiperiodic and Lyndon episturmian words

13 years 11 months ago

Download www.ru.is

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...

Amy Glen, Florence Levé, Gwénaë...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers