DLT 2007 | Sciweavers

11

DLT
2004

110views Theoretical Computer Science» more DLT 2004»

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars

13 years 5 months ago

There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda

claim paper

Read More »

9

click to vote

DLT
2004

60views Theoretical Computer Science» more DLT 2004»

The Power of Maximal Parallelism in P Systems

13 years 5 months ago

Download www.eecs.wsu.edu

Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang

claim paper

Read More »

20

click to vote

DLT
2004

111views Theoretical Computer Science» more DLT 2004»

Some New Directions and Questions in Parameterized Complexity

13 years 5 months ago

Download www.mcs.vuw.ac.nz

Recently there have been some new initiatives in the field of parameterized complexity. In this paper, we will report on some of these, concentrating on some open questions, and al...

Rodney G. Downey, Catherine McCartin

claim paper

Read More »

15

click to vote

DLT
2004

76views Theoretical Computer Science» more DLT 2004»

On Competence in CD Grammar Systems

13 years 5 months ago

Download fmt.isti.cnr.it

Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...

Maurice H. ter Beek, Erzsébet Csuhaj-Varj&u...

claim paper

Read More »

11

click to vote

DLT
2004

96views Theoretical Computer Science» more DLT 2004»

Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey

13 years 5 months ago

Download www.labri.fr

New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...

Bruno Courcelle

claim paper

Read More »

11

click to vote

DLT
2004

82views Theoretical Computer Science» more DLT 2004»

On the Maximum Coefficients of Rational Formal Series in Commuting Variables

13 years 5 months ago

Download lonati.dsi.unimi.it

We study the maximum function of any R+-rational formal series S in two commuting variables, which assigns to every integer n N, the maximum coefficient of the monomials of degree...

Christian Choffrut, Massimiliano Goldwurm, Violett...

claim paper

Read More »

8

click to vote

DLT
2007

108views Theoretical Computer Science» more DLT 2007»

Duplication Roots

13 years 5 months ago

Download www.wortspieler.org

Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...

Peter Leupold

claim paper

Read More »

13

click to vote

DLT
2007

93views Theoretical Computer Science» more DLT 2007»

What Do We Know About Language Equations?

13 years 5 months ago

Download www.math.muni.cz

Michal Kunc

claim paper