An efficient characterization of Petri net solvable binary words (Q2280188)

From MaRDI portal
Revision as of 13:47, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient characterization of Petri net solvable binary words
scientific article

    Statements

    An efficient characterization of Petri net solvable binary words (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2019
    0 references
    Petri net
    0 references
    binary word
    0 references
    word solvability
    0 references
    reversibility
    0 references
    binary transition system
    0 references

    Identifiers