Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Geffert:1988:RRE,
author = "Viliam Geffert",
title = "A representation of a recursively enumerable languages
by two homomorphisms and a quotient",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "235--249",
month = dec,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of P. J. Safarik",
affiliationaddress = "Kosice, Czech",
classification = "721; 921; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Univ. of P. J. Safarik, Kosice,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Formal Languages; formal languages;
Homomorphisms; homomorphisms; Mathematical
Techniques--Set Theory; quotient; Quotient Operation;
Recursively Enumerable Languages; recursively
enumerable languages; Right Overflow Languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "Representation of a recursively enumerable languages
by two homomorphisms and a quotient",
xxtitle = "A presentation of a recursively enumerable languages
by two homomorphisms and a quotient",
}