DLT 2007 | Sciweavers

30

click to vote

DLT
2003

130views Theoretical Computer Science» more DLT 2003»

About Duval's Conjecture

14 years 1 months ago

Download www.fmi.uni-stuttgart.de

Tero Harju, Dirk Nowotka

claim paper

Read More »

31

click to vote

DLT
2003

135views Theoretical Computer Science» more DLT 2003»

On a Conjecture of Schnoebelen

14 years 1 months ago

Download hal.archives-ouvertes.fr

The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a ﬁnite set ...

Antonio Cano Gómez, Jean-Eric Pin

claim paper

Read More »

34

click to vote

DLT
2003

106views Theoretical Computer Science» more DLT 2003»

On Three Classes of Automata-Like P Systems

14 years 1 months ago

Download psystems.disco.unimib.it

Rudolf Freund, Carlos Martín-Vide, Adam Obt...

claim paper

Read More »

28

click to vote

DLT
2003

108views Theoretical Computer Science» more DLT 2003»

On Well Quasi-orders on Languages

14 years 1 months ago

Download www.dia.unisa.it

Flavio D'Alessandro, Stefano Varricchio

claim paper

Read More »

42

click to vote

DLT
2003

113views Theoretical Computer Science» more DLT 2003»

NFA Reduction Algorithms by Means of Regular Inequalities

14 years 1 months ago

Download jmc.feydakins.org

We present diﬀerent techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...

Jean-Marc Champarnaud, Fabien Coulon

claim paper

Read More »

31

click to vote

DLT
2003

96views Theoretical Computer Science» more DLT 2003»

Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models

14 years 1 months ago

Download lonati.dsi.unimi.it

We study the random variable Yn representing the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model we assume is a simple non-e...

Diego de Falco, Massimiliano Goldwurm, Violetta Lo...

claim paper

Read More »

34

click to vote

DLT
2001

78views Theoretical Computer Science» more DLT 2001»

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable

14 years 1 months ago

Download www.labri.fr

Dietrich Kuske

claim paper

Read More »

42

click to vote

DLT
2001

116views Theoretical Computer Science» more DLT 2001»

Context-Free Valence Grammars - Revisited

14 years 1 months ago

Download www.liacs.nl

Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...

Hendrik Jan Hoogeboom

claim paper

Read More »

29

click to vote

DLT
2001

98views Theoretical Computer Science» more DLT 2001»

Automata on Series-Parallel Biposets

14 years 1 months ago

Download www.brics.dk

Zoltán Ésik, Zoltán L. N&eacu...

claim paper