Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610)
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: Efficient inclusion testing for simple classes of unambiguous -automata |
scientific article; zbMATH DE number 6059712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata |
scientific article; zbMATH DE number 6059712 |
Statements
Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (English)
0 references
25 July 2012
0 references
formal languages
0 references
automata theory
0 references
\(\omega \)-automata
0 references
unambiguous automata
0 references
inclusion
0 references
0.7871984839439392
0 references
0.7787811756134033
0 references
0.7682339549064636
0 references
