Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282)
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 algorithms for membership in Boolean hierarchies of regular languages |
scientific article; zbMATH DE number 6620951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for membership in Boolean hierarchies of regular languages |
scientific article; zbMATH DE number 6620951 |
Statements
Efficient algorithms for membership in Boolean hierarchies of regular languages (English)
0 references
31 August 2016
0 references
automata and formal languages
0 references
computational complexity
0 references
dot-depth hierarchy
0 references
Boolean hierarchy
0 references
decidability
0 references
efficient algorithms
0 references
0.9999999
0 references
0.88496506
0 references
0.88122094
0 references
0 references
0 references
0.87653005
0 references
0.86602616
0 references
0.8646196
0 references
