Sciweavers

    JALC
    2007
    90views more  JALC 2007»
    Learning Unary Automata
    13 years 11 months ago
    Learning Unary Automata
    Download  www.niflheim.de
    We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
    Gregor Gramlich, Ralf Herrmann
    claim paper
    Read More »
    JALC
    2007
    95views more  JALC 2007»
    Learning Regular Tree Languages from Correction and Equivalence Queries
    13 years 11 months ago
    Learning Regular Tree Languages from Correction and Equivalence Queries
    Download  grammars.grlmc.com
    Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
    Catalin Ionut Tîrnauca, Cristina Tîrna...
    claim paper
    Read More »
    JALC
    2007
    69views more  JALC 2007»
    Weighted Automata for Proving Termination of String Rewriting
    13 years 11 months ago
    Weighted Automata for Proving Termination of String Rewriting
    Download  www.imn.htwk-leipzig.de
    Johannes Waldmann
    claim paper
    Read More »
    JALC
    2007
    84views more  JALC 2007»
    Enumeration of Context-Free Languages and Related Structures
    13 years 11 months ago
    Enumeration of Context-Free Languages and Related Structures
    Download  www.cs.umanitoba.ca
    In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
    Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
    claim paper
    Read More »
    JALC
    2007
    109views more  JALC 2007»
    A Family of NFAs Free of State Reductions
    13 years 11 months ago
    A Family of NFAs Free of State Reductions
    Download  cs.smu.ca
    Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
    Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    claim paper
    Read More »
    JALC
    2007
    79views more  JALC 2007»
    Two-Way Finite Automata with a Write-Once Track
    13 years 11 months ago
    Two-Way Finite Automata with a Write-Once Track
    Download  lambda-diode.com
    The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
    Berke Durak
    claim paper
    Read More »
    JALC
    2007
    57views more  JALC 2007»
    Multi-dimensional Descriptional Complexity of P Systems
    13 years 11 months ago
    Multi-dimensional Descriptional Complexity of P Systems
    Download  www.cs.us.es
    Miguel A. Gutiérrez-Naranjo, Mario J. P&eac...
    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.