DLT 2007 | Sciweavers

37

DLT
2007

112views Theoretical Computer Science» more DLT 2007»

State Complexity of Union and Intersection of Finite Languages

14 years 1 months ago

Abstract. We investigate the state complexity of union and intersection for ﬁnite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...

Yo-Sub Han, Kai Salomaa

claim paper

Read More »

26

click to vote

DLT
2007

80views Theoretical Computer Science» more DLT 2007»

Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP

14 years 1 months ago

Download www.informatik.uni-giessen.de

Abstract. Inapproximability results concerning minimization of nondeterministic ﬁnite automata relative to given deterministic ﬁnite automata were obtained only recently, modul...

Hermann Gruber, Markus Holzer

claim paper

Read More »

30

click to vote

DLT
2007

111views Theoretical Computer Science» more DLT 2007»

On First-Order Fragments for Words and Mazurkiewicz Traces

14 years 1 months ago

Download www.fmi.uni-stuttgart.de

Volker Diekert, Manfred Kufleitner

claim paper

Read More »

24

click to vote

DLT
2007

60views Theoretical Computer Science» more DLT 2007»

An Efficient Computation of the Equation K-Automaton of a Regular K-Expression

14 years 1 months ago

Download www.cmi.univ-mrs.fr

Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...

claim paper

Read More »

58

click to vote

DLT
2007

135views Theoretical Computer Science» more DLT 2007»

2-Visibly Pushdown Automata

14 years 1 months ago

Download people.na.infn.it

Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...

Dario Carotenuto, Aniello Murano, Adriano Peron

claim paper

Read More »

40

click to vote

DLT
2007

111views Theoretical Computer Science» more DLT 2007»

Two Element Unavoidable Sets of Partial Words

14 years 1 months ago

Download www.uncg.edu

d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...

Francine Blanchet-Sadri, N. C. Brownstein, Justin ...

claim paper

Read More »

46

click to vote

DLT
2007

85views Theoretical Computer Science» more DLT 2007»

The Dynamics of Cellular Automata in Shift-Invariant Topologies

14 years 1 months ago

Download iml.univ-mrs.fr

Abstract. We study the dynamics of cellular automata, and more specifically their transitivity and expansivity, when the set of conﬁgurations is endowed with a shift-invariant (p...

Laurent Bienvenu, Mathieu Sablik

claim paper

Read More »

27

click to vote

DLT
2007

112views Theoretical Computer Science» more DLT 2007»

Coding Partitions: Regularity, Maximality and Global Ambiguity

14 years 1 months ago

Download igm.univ-mlv.fr

The canonical coding partition of a set of words is the ﬁnest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In...

Marie-Pierre Béal, Fabio Burderi, Antonio R...

claim paper

Read More »

33

click to vote

DLT
2007

104views Theoretical Computer Science» more DLT 2007»

From Determinism to Non-determinism in Recognizable Two-Dimensional Languages

14 years 1 months ago

Download www.dia.unisa.it

Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...

Marcella Anselmo, Dora Giammarresi, Maria Madonia

claim paper

Read More »

25

click to vote

DLT
2007

67views Theoretical Computer Science» more DLT 2007»

On Transition Minimality of Bideterministic Automata

14 years 1 months ago