Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
25
click to vote
APN
2015
Springer
favorite
Email
discuss
report
21
views
Artificial Intelligence
»
more
APN 2015
»
On Binary Words Being Petri Net Solvable
8 years 4 months ago
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
Real-time Traffic
APN 2015
|
Artificial Intelligence
|
claim paper
Related Content
»
TwoVariable Logic on Words with Data
»
Optimal leaf ordering of complete binary trees
more »
Post Info
More Details (n/a)
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)
Researcher Info
Artificial Intelligence Study Group
Computer Vision