An efficient characterization of Petri net solvable binary words (Q2280188): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): conf/apn/Frutos-EscrigKM18, #quickstatements; #temporary_batch_1735672051997 |
||
| (One intermediate revision by the same user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q104379649 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/apn/Frutos-EscrigKM18 / rank | |||
Normal rank | |||
Latest revision as of 20:09, 31 December 2024
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
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
