The equivalence problem of E-pattern languages with regular constraints is undecidable

From MaRDI portal

Publication:6666804

Jump to:navigation, search

DOI10.1007/978-3-031-71112-1_20MaRDI QIDQ6666804

Dirk Nowotka, Max Wiedenhöft

Publication date: 20 January 2025

zbMATH Keywords

equivalence undecidability automata patterns pattern languages regular constraints membership inclusion

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: The equivalence problem of E-pattern languages with regular constraints is undecidable

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6666804&oldid=40247045"