Closure properties and complexity of rational sets of regular languages (Q888431)
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: Closure properties and complexity of rational sets of regular languages |
scientific article; zbMATH DE number 6502579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Closure properties and complexity of rational sets of regular languages |
scientific article; zbMATH DE number 6502579 |
Statements
Closure properties and complexity of rational sets of regular languages (English)
0 references
30 October 2015
0 references
rational sets
0 references
regular languages
0 references
test specification in FQL
0 references
closure properties
0 references
decision problems
0 references
0 references
0.95044196
0 references
0.92444146
0 references
0 references
0.9190914
0 references
0.9149493
0 references
0.9106411
0 references
0.90955377
0 references
0.90000176
0 references
0.89832795
0 references
0 references
