Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2016.07.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2016.07.017 / rank | |||
Normal rank | |||
Latest revision as of 13:52, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for membership in Boolean hierarchies of regular languages |
scientific article |
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
