Sciweavers

    PARLE
    1987
    144views Distributed And Parallel Com...» more  PARLE 1987»
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
    15 years 6 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 »
    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.