A note on deciding the controllability of a language K with respect to a language L (Q5288788)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on deciding the controllability of a language K with respect to a language L |
scientific article; zbMATH DE number 270104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on deciding the controllability of a language K with respect to a language L |
scientific article; zbMATH DE number 270104 |
Statements
A note on deciding the controllability of a language K with respect to a language L (English)
0 references
22 August 1993
0 references
controllability of a language
0 references
plant automaton
0 references
decidability
0 references
Petri net reachability problem
0 references
0.8314343094825745
0 references
0.8302165269851685
0 references
0.828926146030426
0 references
0.8134489059448242
0 references
