A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Languages defined by generalized equality sets
Tekijät: Halava V, Harju T, Hoogeboom HJ, Latteux M
Julkaisuvuosi: 2003
Lehti:: Lecture Notes in Computer Science
Tietokannassa oleva lehden nimi: FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 2751
Aloitussivu: 355
Lopetussivu: 363
Sivujen määrä: 9
ISBN: 3-540-40543-7
ISSN: 0302-9743
Tiivistelmä
We consider the generalized equality sets which are of the form E-G(a,g(1),g(2)) = {w \ g(1)(w) = ag(2)(w)}, determined by instances of the generalized Post Correspondence Problem, where the morphisms g(1) and g(2) are nonerasing and a is a letter. We are interested in the family consisting of the languages h(E-G(J)), where h is a coding and J is a shifted equality set of the above form. WE prove several closure properties for this family.
We consider the generalized equality sets which are of the form E-G(a,g(1),g(2)) = {w \ g(1)(w) = ag(2)(w)}, determined by instances of the generalized Post Correspondence Problem, where the morphisms g(1) and g(2) are nonerasing and a is a letter. We are interested in the family consisting of the languages h(E-G(J)), where h is a coding and J is a shifted equality set of the above form. WE prove several closure properties for this family.
Turun yliopiston Tutkimustietojärjestelmän portaali