Sciweavers

    DLT
    2006
    74views Theoretical Computer Science» more  DLT 2006»
    Noncanonical LALR(1) Parsing
    14 years 25 days ago
    Noncanonical LALR(1) Parsing
    Download  www.lsv.ens-cachan.fr
    This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
    Sylvain Schmitz
    claim paper
    Read More »
    DLT
    2006
    96views Theoretical Computer Science» more  DLT 2006»
    On Weakly Ambiguous Finite Transducers
    14 years 25 days ago
    On Weakly Ambiguous Finite Transducers
    Download  cs.smu.ca
    By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
    Nicolae Santean, Sheng Yu
    claim paper
    Read More »
    DLT
    2006
    111views Theoretical Computer Science» more  DLT 2006»
    Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
    14 years 25 days ago
    Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
    Download  www.fmi.uni-stuttgart.de
    Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
    Manfred Kufleitner
    claim paper
    Read More »
    DLT
    2006
    114views Theoretical Computer Science» more  DLT 2006»
    On Critical Exponents in Fixed Points of Non-erasing Morphisms
    14 years 25 days ago
    On Critical Exponents in Fixed Points of Non-erasing Morphisms
    Download  www.wisdom.weizmann.ac.il
    Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
    Dalia Krieger
    claim paper
    Read More »
    DLT
    2006
    132views Theoretical Computer Science» more  DLT 2006»
    Well-Founded Semantics for Boolean Grammars
    14 years 25 days ago
    Well-Founded Semantics for Boolean Grammars
    Download  cgi.di.uoa.gr
    Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
    Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
    claim paper
    Read More »
    DLT
    2006
    110views Theoretical Computer Science» more  DLT 2006»
    Hierarchies of Tree Series Transformations Revisited
    14 years 25 days ago
    Hierarchies of Tree Series Transformations Revisited
    Download  wwwtcs.inf.tu-dresden.de
    Abstract. Tree series transformations computed by polynomial topdown and bottom-up tree series transducers are considered. The hierarchy of tree series transformations obtained in ...
    Andreas Maletti
    claim paper
    Read More »
    DLT
    2006
    110views Theoretical Computer Science» more  DLT 2006»
    Closure of Language Classes Under Bounded Duplication
    14 years 25 days ago
    Closure of Language Classes Under Bounded Duplication
    Download  www.wortspieler.org
    Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
    Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
    claim paper
    Read More »
    DLT
    2006
    165views Theoretical Computer Science» more  DLT 2006»
    Prime Decompositions of Regular Languages
    14 years 25 days ago
    Prime Decompositions of Regular Languages
    Download  cs.yonsei.ac.kr
    We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...
    Yo-Sub Han, Kai Salomaa, Derick Wood
    claim paper
    Read More »
    DLT
    2006
    194views Theoretical Computer Science» more  DLT 2006»
    Can Abstract State Machines Be Useful in Language Theory?
    14 years 25 days ago
    Can Abstract State Machines Be Useful in Language Theory?
    Download  research.microsoft.com
    ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
    Yuri Gurevich, Charles Wallace
    claim paper
    Read More »
    DLT
    2006
    98views Theoretical Computer Science» more  DLT 2006»
    Finding Lower Bounds for Nondeterministic State Complexity Is Hard
    14 years 25 days ago
    Finding Lower Bounds for Nondeterministic State Complexity Is Hard
    Download  www.informatik.uni-giessen.de
    We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
    Hermann Gruber, Markus Holzer
    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.