Sciweavers

    66
    Voted
    DLT
    2007
    93views Theoretical Computer Science» more  DLT 2007»
    What Do We Know About Language Equations?
    15 years 10 days ago
    What Do We Know About Language Equations?
    Download  www.math.muni.cz
    Michal Kunc
    claim paper
    Read More »
    52
    Voted
    DLT
    2007
    94views Theoretical Computer Science» more  DLT 2007»
    Avoiding Approximate Squares
    15 years 10 days ago
    Avoiding Approximate Squares
    Download  www.lri.fr
    Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeff...
    claim paper
    Read More »
    61
    Voted
    DLT
    2007
    75views Theoretical Computer Science» more  DLT 2007»
    Quantitative Generalizations of Languages
    15 years 10 days ago
    Quantitative Generalizations of Languages
    Download  mtc.epfl.ch
    Thomas A. Henzinger
    claim paper
    Read More »
    95
    Voted
    DLT
    2007
    112views Theoretical Computer Science» more  DLT 2007»
    State Complexity of Union and Intersection of Finite Languages
    15 years 10 days 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 »
    69
    Voted
    DLT
    2007
    80views Theoretical Computer Science» more  DLT 2007»
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    15 years 10 days 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 »
    68
    Voted
    DLT
    2007
    111views Theoretical Computer Science» more  DLT 2007»
    On First-Order Fragments for Words and Mazurkiewicz Traces
    15 years 10 days ago
    On First-Order Fragments for Words and Mazurkiewicz Traces
    Download  www.fmi.uni-stuttgart.de
    Volker Diekert, Manfred Kufleitner
    claim paper
    Read More »
    61
    Voted
    DLT
    2007
    60views Theoretical Computer Science» more  DLT 2007»
    An Efficient Computation of the Equation K-Automaton of a Regular K-Expression
    15 years 10 days 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 »
    102
    Voted
    DLT
    2007
    135views Theoretical Computer Science» more  DLT 2007»
    2-Visibly Pushdown Automata
    15 years 10 days 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 »
    103
    Voted
    DLT
    2007
    111views Theoretical Computer Science» more  DLT 2007»
    Two Element Unavoidable Sets of Partial Words
    15 years 10 days 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
    15 years 10 days 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 »
    « first‹ previous…135136137138139140141142143…next ›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-2025, USA.