Sciweavers

    APN
    2015
    Springer
    21views Artificial Intelligence» more  APN 2015»

    On Binary Words Being Petri Net Solvable

    8 years 5 days ago
    On Binary Words Being Petri Net Solvable
    Download  ceur-ws.org
    A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable words is studied.
    Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz
    claim paper
    Related Content
    Added 16 Apr 2016
    Updated 16 Apr 2016
    Type Journal
    Year 2015
    Where APN
    Authors Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
    Comments (0)
    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.