Sciweavers

    DLT
    2009
    96views Theoretical Computer Science» more  DLT 2009»
    On Negative Bases
    13 years 8 months ago
    On Negative Bases
    Download  www.liafa.jussieu.fr
    Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
    Christiane Frougny, Anna Chiara Lai
    claim paper
    Read More »
    DLT
    2009
    114views Theoretical Computer Science» more  DLT 2009»
    Definability in the Infix Order on Words
    13 years 8 months ago
    Definability in the Infix Order on Words
    Download  www.emis.de
    Oleg V. Kudinov, Victor L. Selivanov
    claim paper
    Read More »
    DLT
    2009
    134views Theoretical Computer Science» more  DLT 2009»
    Weighted versus Probabilistic Logics
    13 years 8 months ago
    Weighted versus Probabilistic Logics
    Download  www.lsv.ens-cachan.fr
    While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
    Benedikt Bollig, Paul Gastin
    claim paper
    Read More »
    DLT
    2009
    116views Theoretical Computer Science» more  DLT 2009»
    Strongly Regular Grammars and Regular Approximation of Context-Free Languages
    13 years 8 months ago
    Strongly Regular Grammars and Regular Approximation of Context-Free Languages
    Download  www.cs.ucsb.edu
    Abstract. We consider algorithms for approximating context
    Ömer Egecioglu
    claim paper
    Read More »
    DLT
    2009
    87views Theoretical Computer Science» more  DLT 2009»
    Tight Bounds on the Descriptional Complexity of Regular Expressions
    13 years 8 months ago
    Tight Bounds on the Descriptional Complexity of Regular Expressions
    Download  www.informatik.uni-giessen.de
    Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
    Hermann Gruber, Markus Holzer
    claim paper
    Read More »
    DLT
    2009
    91views Theoretical Computer Science» more  DLT 2009»
    Subshifts, Languages and Logic
    13 years 8 months ago
    Subshifts, Languages and Logic
    Download  hal.archives-ouvertes.fr
    We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
    Emmanuel Jeandel, Guillaume Theyssier
    claim paper
    Read More »
    DLT
    2009
    112views Theoretical Computer Science» more  DLT 2009»
    On the Complexity of Deciding Avoidability of Sets of Partial Words
    13 years 8 months ago
    On the Complexity of Deciding Avoidability of Sets of Partial Words
    Download  www.uncg.edu
    Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
    Brandon Blakeley, Francine Blanchet-Sadri, Josh Gu...
    claim paper
    Read More »
    DLT
    2009
    134views Theoretical Computer Science» more  DLT 2009»
    Factorization Forests
    13 years 8 months ago
    Factorization Forests
    Download  www.mimuw.edu.pl
    A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
    Mikolaj Bojanczyk
    claim paper
    Read More »
    DLT
    2009
    76views Theoretical Computer Science» more  DLT 2009»
    A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
    13 years 8 months ago
    A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
    Download  www-igm.univ-mlv.fr
    Cern
    Marie-Pierre Béal, Dominique Perrin
    claim paper
    Read More »
    DLT
    2009
    118views Theoretical Computer Science» more  DLT 2009»
    The Pumping Lemma for Well-Nested Multiple Context-Free Languages
    13 years 8 months ago
    The Pumping Lemma for Well-Nested Multiple Context-Free Languages
    Download  research.nii.ac.jp
    Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
    Makoto Kanazawa
    claim paper
    Read More »
    12next ›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.