On the equivalence problem for E-pattern languages over small alphabets

We contribute new facets to the discussion on the equivalence problem for E-pattern languages (also referred to as extended or erasing pattern languages). This fundamental open question asks for the existence of a computable function that, given any pair of patterns, decides whether or not they gene...

Full description

Bibliographic Details

Main Author:	Daniel Reidenbach
Format:	Default Article
Published:	2005
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/3472
Tags:	Add Tag No Tags, Be the first to tag this record!