How to prove that a language is regular or star-free? (Q782557)
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: How to prove that a language is regular or star-free? |
scientific article; zbMATH DE number 7225116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to prove that a language is regular or star-free? |
scientific article; zbMATH DE number 7225116 |
Statements
How to prove that a language is regular or star-free? (English)
0 references
27 July 2020
0 references
