The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nowotka, Dirk, Wiedenhöft, Max
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Computational Complexity Combinatorics 68R15 F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2411.07275