Sciweavers

    1650 search results - page 6 / 330
    » The HOM problem is decidable
    Sort
    View
    116
    Voted
    FSTTCS
    2005
    Springer
    102views Software Engineering» more  FSTTCS 2005»
    The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
    15 years 11 months ago
    The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
    Download  www.cse.unsw.edu.au
    Joost Engelfriet, Sebastian Maneth
    claim paper
    Read More »
    HYBRID
    2001
    Springer
    137views Control Systems» more  HYBRID 2001»
    On the Decidability of the Reachability Problem for Planar Differential Inclusions
    15 years 10 months ago
    On the Decidability of the Reachability Problem for Planar Differential Inclusions
    Download  www.cs.um.edu.mt
    Eugene Asarin, Gerardo Schneider, Sergio Yovine
    claim paper
    Read More »
    ITA
    2000
    76views Communications» more  ITA 2000»
    On the Decidability of the Equivalence Problem for Monadic Recursive Programs
    15 years 5 months ago
    On the Decidability of the Equivalence Problem for Monadic Recursive Programs
    Download  lvk.cs.msu.su
    Vladimir A. Zakharov
    claim paper
    Read More »
    MFCS
    2005
    Springer
    131views Theoretical Computer Science» more  MFCS 2005»
    Inverse Monoids: Decidability and Complexity of Algebraic Questions
    15 years 11 months ago
    Inverse Monoids: Decidability and Complexity of Algebraic Questions
    Download  www.informatik.uni-leipzig.de
    This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
    Markus Lohrey, Nicole Ondrusch
    claim paper
    Read More »
    DLT
    2008
    93views Theoretical Computer Science» more  DLT 2008»
    When Is Reachability Intrinsically Decidable?
    15 years 7 months ago
    When Is Reachability Intrinsically Decidable?
    Download  www.math.uwaterloo.ca
    A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
    Barbara F. Csima, Bakhadyr Khoussainov
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.