Emptiness of zero automata is decidable (Q5111438)
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: Emptiness of zero automata is decidable |
scientific article; zbMATH DE number 7204558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Emptiness of zero automata is decidable |
scientific article; zbMATH DE number 7204558 |
Statements
27 May 2020
0 references
tree automata
0 references
probabilistic automata
0 references
monadic second-order logic
0 references
0.812009334564209
0 references
0.7730339765548706
0 references
0.7563134431838989
0 references
0.7539517283439636
0 references
