Entry Paun:1996:CS from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Paun:1996:CS,
author = "Gheorghe P{\u{a}}un and Grzegorz Rozenberg and Arto
Salomaa",
title = "Computing by splicing",
journal = j-THEOR-COMP-SCI,
volume = "168",
number = "2",
pages = "321--336",
day = "20",
month = nov,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:25 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=168&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=168&issue=2&aid=2284",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4220 (Automata theory)",
conflocation = "Paris, France; 28-30 March 1995",
conftitle = "International Workshop on Universal Machines and
Computations",
corpsource = "Inst. of Math., Acad. of Sci., Bucuresti, Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computing by splicing; context-free languages; formal
languages; molecular genetics; recursively enumerable
languages; splicing systems; Turing machines",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- computing,
137(1)129,
138(1)211,
139(1)69,
141(1)1,
141(1)175,
147(1)181,
149(1)101,
155(1)157,
156(1)99,
156(1)217,
157(1)115,
161(1)69,
163(1)269,
164(1)107,
164(1)299,
169(1)67,
174(1)123,
180(1)115,
180(1)287,
181(1)159,
181(1)181,
181(1)195,
182(1)159,
185(2)259,
187(1)81,
187(1)87,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
190(1)61,
191(1)1,
192(2)315,
194(1)123,
194(1)225,
194(1)241,
194(1)242-1,
194(1)z,
195(1)3,
196(1)109,
196(1)153,
196(1)319,
197(1)79,
197(1)157,
197(1)171,
199(1)145,
209(1)331,
209(1)389
- context-free,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)143,
158(1)161,
161(1)23,
161(1)141,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
197(1)189,
202(1)231,
215(1)349
- enumerable,
147(1)149,
161(1)235,
197(1)79,
205(1)61,
205(1)195
- free, context-,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)143,
158(1)161,
161(1)23,
161(1)141,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
197(1)189,
202(1)231,
215(1)349
- genetic,
200(1)101,
229(1)11,
229(1)23,
229(1)41,
229(1)143
- molecular,
180(1)115,
181(1)159,
185(1)3,
210(2)305
- P{\u{a}}un, Gheorghe,
141(1)253,
154(2)183,
204(1)183,
205(1)61,
205(1)195
- recursively,
147(1)149,
160(1)241,
161(1)235,
161(1)263,
197(1)79,
205(1)61,
205(1)195
- Rozenberg, Grzegorz,
154(2)183,
155(2)425,
183(1)1,
197(1)1,
204(1)183,
205(1)61
- Salomaa, Arto,
141(1)253,
154(2)183,
158(1)161,
183(1)1,
197(1)1,
204(1)131,
205(1)195
- splicing,
210(2)227
- Turing,
138(1)67,
143(1)123,
143(1)159,
145(1)111,
148(1)33,
148(2)325,
158(1)193,
161(1)301,
162(1)45,
168(2)215,
168(2)241,
168(2)257,
168(2)267,
168(2)303,
168(2)417,
168(2)461,
168(2)z,
172(1)135,
174(1)203,
174(1)217,
180(1)139,
180(1)229,
180(1)341,
181(1)119,
182(1)159,
191(1)215,
192(2)315,
194(1)137,
197(1)79,
210(1)217,
217(1)3,
411(31)2999