Abstract
A word is called Petri net solvable if it is isomorphic to the reachability graph of an unlabelled Petri net. In this paper, the class of finite, two-letter, Petri net solvable, words is studied. Two conjectures providing different characterisations of this class of words are motivated and proposed. One conjecture characterises the class in terms of pattern-matching, the other in terms of letter-counting. Several results are described which amount to a partial proof of these conjectures.
Author supplied keywords
Cite
CITATION STYLE
Barylska, K., Best, E., Erofeev, E., Mikulski, Ł., & Piatkowski, M. (2016). Conditions for petri net solvable binary words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9930 LNCS, pp. 137–159). Springer Verlag. https://doi.org/10.1007/978-3-662-53401-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
