Simplification problems for deterministic pushdown automata on infinite words (Q2800412)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6569398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplification problems for deterministic pushdown automata on infinite words |
scientific article; zbMATH DE number 6569398 |
Statements
15 April 2016
0 references
automata theory
0 references
pushdown automata
0 references
\(\omega\)-automata
0 references
parity index
0 references
Simplification problems for deterministic pushdown automata on infinite words (English)
0 references
0.9626521468162536
0 references
0.7746963500976562
0 references
0.7746327519416809
0 references
