Entry Geffert:1988:RRE from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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",
}
Related entries
- enumerable,
35(2)227,
35(2)261,
38(1)17,
41(1)1,
42(2)123,
55(2)183
- homomorphism,
35(2)295,
36(1)109,
38(2)323,
40(2)301,
42(2)123,
44(1)17,
44(2)175,
50(2)103,
58(1)175,
61(1)1,
61(2)283,
69(3)319
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- operation,
35(2)271,
36(2)291,
36(2)333,
39(2)327,
40(2)257,
42(2)123,
47(3)237,
48(2)145,
48(2)273,
49(2)185,
51(3)281,
52(1)1,
52(3)251,
55(2)183,
55(2)265,
58(1)175,
60(3)297,
61(2)199,
62(1)3,
64(1)119,
64(3)221,
66(2)157,
68(1)71
- quotient,
39(1)3,
63(1)19,
65(2)221
- recursively,
35(2)227,
35(2)261,
38(1)17,
41(1)1,
42(2)123,
54(1)29,
55(2)183,
68(3)303
- representation,
35(2)271,
38(1)35,
38(1)83,
38(1)133,
43(2)201,
47(3)299,
47(3)315,
48(2)201,
52(3)307,
53(2)243,
54(2)341,
55(2)183,
61(2)175,
62(1)39,
64(1)1,
64(1)15,
66(3)247,
68(3)333
- Set, Techniques-,
60(3)297,
61(2)307,
62(1)221,
63(1)43,
63(1)63,
63(3)239
- Techniques--Set,
60(3)297,
61(2)307,
62(1)221,
63(1)43,
63(1)63,
63(3)239
- two,
37(1)51,
38(2)167,
40(2)319,
46(1)101,
47(2)191,
47(3)237,
49(1)81,
58(1)17,
58(1)361,
61(1)67,
63(1)1,
63(2)141,
63(2)157,
64(1)39,
66(3)233