Sciweavers

    268 search results - page 9 / 54
    » Linear Context Free Languages
    Sort
    View
    PARLE
    1987
    144views Distributed And Parallel Com...» more  PARLE 1987»
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
    13 years 10 months ago
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
    Download  web.mac.com
    A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
    Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    claim paper
    Read More »
    DAGM
    2008
    Springer
    124views Image Processing» more  DAGM 2008»
    Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
    13 years 9 months ago
    Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
    Download  www.mmk.ei.tum.de
    This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
    Stefan Schwärzler, Joachim Schenk, Frank Wall...
    claim paper
    Read More »
    COLING
    2000
    102views Computational Linguistics» more  COLING 2000»
    Combination Of N-Grams And Stochastic Context-Free Grammars For Language Modeling
    13 years 8 months ago
    Combination Of N-Grams And Stochastic Context-Free Grammars For Language Modeling
    Download  acl.ldc.upenn.edu
    José-Miguel Benedí, Joan-Andreu S&aa...
    claim paper
    Read More »
    IJFCS
    2010
    58views more  IJFCS 2010»
    Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time
    13 years 5 months ago
    Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time
    Download  www.ii.uni.wroc.pl
    Pawel Gawrychowski, Dalia Krieger, Narad Rampersad...
    claim paper
    Read More »
    WOLLIC
    2010
    Springer
    248views Artificial Intelligence» more  WOLLIC 2010»
    Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
    13 years 5 months ago
    Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
    Download  nicta.com.au
    We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
    Aditi Barthwal, Michael Norrish
    claim paper
    Read More »
    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.