The equivalence problem of E-pattern languages with regular constraints is undecidable (Q6666804)
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: The equivalence problem of E-pattern languages with regular constraints is undecidable |
scientific article; zbMATH DE number 7970863
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem of E-pattern languages with regular constraints is undecidable |
scientific article; zbMATH DE number 7970863 |
Statements
The equivalence problem of E-pattern languages with regular constraints is undecidable (English)
0 references
20 January 2025
0 references
patterns
0 references
pattern languages
0 references
regular constraints
0 references
undecidability
0 references
automata
0 references
membership
0 references
inclusion
0 references
equivalence
0 references
0 references
