An efficient characterization of Petri net solvable binary words (Q2280188): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q554218 |
Created claim: DBLP publication ID (P1635): conf/apn/Frutos-EscrigKM18, #quickstatements; #temporary_batch_1735672051997 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: David de Frutos-Escrig / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-91268-4_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2801591860 / rank | |||
Normal rank | |||
| 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
