A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Presburger Automata / rank | |||
Normal rank | |||
Revision as of 21:02, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A formalisation of the Myhill-Nerode theorem based on regular expressions |
scientific article |
Statements
A formalisation of the Myhill-Nerode theorem based on regular expressions (English)
0 references
23 June 2015
0 references
regular languages
0 references
theorem provers
0 references
Myhill-Nerode theorem
0 references
