Sciweavers

    DLT
    2007
    112views Theoretical Computer Science» more  DLT 2007»
    State Complexity of Union and Intersection of Finite Languages
    13 years 5 months ago
    State Complexity of Union and Intersection of Finite Languages
    Download  cs.yonsei.ac.kr
    Abstract. We investigate the state complexity of union and intersection for finite 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 »
    DLT
    2007
    80views Theoretical Computer Science» more  DLT 2007»
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    13 years 5 months ago
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    Download  www.informatik.uni-giessen.de
    Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
    Hermann Gruber, Markus Holzer
    claim paper
    Read More »
    DLT
    2007
    111views Theoretical Computer Science» more  DLT 2007»
    On First-Order Fragments for Words and Mazurkiewicz Traces
    13 years 5 months ago
    On First-Order Fragments for Words and Mazurkiewicz Traces
    Download  www.fmi.uni-stuttgart.de
    Volker Diekert, Manfred Kufleitner
    claim paper
    Read More »
    DLT
    2007
    60views Theoretical Computer Science» more  DLT 2007»
    An Efficient Computation of the Equation K-Automaton of a Regular K-Expression
    13 years 5 months ago
    An Efficient Computation of the Equation K-Automaton of a Regular K-Expression
    Download  www.cmi.univ-mrs.fr
    Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
    claim paper
    Read More »
    DLT
    2007
    135views Theoretical Computer Science» more  DLT 2007»
    2-Visibly Pushdown Automata
    13 years 5 months ago
    2-Visibly Pushdown Automata
    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 »
    DLT
    2007
    111views Theoretical Computer Science» more  DLT 2007»
    Two Element Unavoidable Sets of Partial Words
    13 years 5 months ago
    Two Element Unavoidable Sets of Partial Words
    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 »
    DLT
    2007
    85views Theoretical Computer Science» more  DLT 2007»
    The Dynamics of Cellular Automata in Shift-Invariant Topologies
    13 years 5 months ago
    The Dynamics of Cellular Automata in Shift-Invariant Topologies
    Download  iml.univ-mrs.fr
    Abstract. We study the dynamics of cellular automata, and more specifically their transitivity and expansivity, when the set of configurations is endowed with a shift-invariant (p...
    Laurent Bienvenu, Mathieu Sablik
    claim paper
    Read More »
    DLT
    2007
    112views Theoretical Computer Science» more  DLT 2007»
    Coding Partitions: Regularity, Maximality and Global Ambiguity
    13 years 5 months ago
    Coding Partitions: Regularity, Maximality and Global Ambiguity
    Download  igm.univ-mlv.fr
    The canonical coding partition of a set of words is the finest 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 »
    DLT
    2007
    104views Theoretical Computer Science» more  DLT 2007»
    From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
    13 years 5 months ago
    From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
    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 »
    DLT
    2007
    67views Theoretical Computer Science» more  DLT 2007»
    On Transition Minimality of Bideterministic Automata
    13 years 5 months ago
    On Transition Minimality of Bideterministic Automata
    Download  www.cs.ioc.ee
    Hellis Tamm
    claim paper
    Read More »
    « first‹ previous1234567next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.