Entry Cazanescu:1985:CFT 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{Cazanescu:1985:CFT,
author = "V. E. Cazanescu",
title = "On context-free trees",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "33--50",
month = "????",
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math., Bucharest Univ., Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free languages;
context-free trees; generalised iterative algebraic
theory; iterate; iterative methods; recursive programs;
trees (mathematics)",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algebraic,
35(2)329,
37(3)269,
37(3)305,
38(2)223,
39(1)3,
40(2)101,
40(2)257,
40(2)329,
41(2)325,
42(1)1,
42(2)123,
43(2)123,
43(2)149,
44(3)333,
45(3)293,
46(1)13,
46(2)285,
46(2)313,
46(2)329,
49(2)121,
50(2)103,
50(2)137,
51(1)117,
52(3)205,
52(3)251,
52(3)307,
54(1)103,
55(2)265,
56(1)37,
57(1)3,
57(1)147,
57(2)205,
60(2)177,
61(1)1,
61(2)199,
66(1)1,
66(2)205,
67(2)143,
67(2)261,
68(1)37,
69(1)69
- context-free,
35(1)1,
35(2)191,
35(2)295,
35(2)313,
36(1)89,
36(1)109,
37(2)217,
37(3)357,
38(1)133,
38(2)323,
39(1)3,
39(1)z,
39(2)89,
40(2)131,
40(2)149,
40(2)315,
41(1)1,
41(1)51,
41(1)105,
41(2)169,
41(2)231,
42(1)1,
44(2)229,
44(3)259,
45(1)87,
46(1)83,
47(1)71,
47(1)95,
47(1)107,
47(2)219,
47(2)225,
47(3)247,
47(3)315,
48(1)101,
48(2)201,
48(2)283,
49(1)23,
49(2)113,
49(2)283,
51(1)81,
51(1)117,
51(3)301,
52(1)59,
52(3)177,
52(3)205,
53(2)295,
53(2)319,
55(2)141,
56(3)321,
57(1)147,
57(2)185,
58(1)69,
62(3)267,
67(1)75
- free, context-,
35(1)1,
35(2)191,
35(2)295,
35(2)313,
36(1)89,
36(1)109,
37(2)217,
37(3)357,
38(1)133,
38(2)323,
39(1)3,
39(1)z,
39(2)89,
40(2)131,
40(2)149,
40(2)315,
41(1)1,
41(1)51,
41(1)105,
41(2)169,
41(2)231,
42(1)1,
44(2)229,
44(3)259,
45(1)87,
46(1)83,
47(1)71,
47(1)95,
47(1)107,
47(2)219,
47(2)225,
47(3)247,
47(3)315,
48(1)101,
48(2)201,
48(2)283,
49(1)23,
49(2)113,
49(2)283,
51(1)81,
51(1)117,
51(3)301,
52(1)59,
52(3)177,
52(3)205,
53(2)295,
53(2)319,
55(2)141,
56(3)321,
57(1)147,
57(2)185,
58(1)69,
62(3)267,
67(1)75
- generalised,
36(2)145,
38(1)99,
38(1)123,
38(1)137,
46(2)175,
47(1)71
- grammar,
35(1)1,
37(1)31,
37(2)123,
37(2)217,
37(3)357,
38(2)323,
39(1)3,
39(1)z,
39(2)281,
40(2)149,
40(2)163,
40(2)315,
41(1)1,
42(1)1,
44(2)229,
44(3)275,
44(3)307,
45(1)87,
47(1)27,
47(1)107,
47(2)219,
47(2)225,
47(3)315,
48(2)201,
49(1)23,
51(1)81,
52(1)1,
52(1)91,
53(1)25,
53(2)295,
55(1)1,
55(1)47,
55(2)141,
59(3)309,
62(3)267,
66(1)65,
67(1)75
- iterative,
39(2)135,
42(3)251,
45(2)193,
47(1)15,
52(3)307,
53(1)151,
57(0)3,
57(1)47,
57(2)327,
58(1)201,
63(3)275,
63(3)303,
65(2)123,
65(2)143
- method,
35(2)345,
36(2)145,
39(2)107,
41(1)19,
44(1)1,
44(2)127,
45(2)193,
46(2)285,
47(3)277,
50(3)285,
52(3)193,
52(3)307,
53(2)345,
54(1)65,
54(1)129,
56(3)277,
58(1)183,
59(1)133,
62(1)187,
63(3)253,
63(3)275,
63(3)303,
65(1)1,
65(2)213,
65(3)291,
67(1)55,
69(1)55
- recursive,
35(2)227,
35(2)261,
36(1)1,
37(1)77,
38(1)17,
38(1)35,
39(1)15,
39(2)207,
40(2)323,
41(2)289,
42(1)1,
42(2)123,
42(3)251,
44(3)307,
45(1)1,
45(2)193,
46(2)239,
47(2)121,
47(2)131,
47(3)299,
51(1)129,
52(3)281,
53(1)25,
53(1)z,
54(1)29,
57(2)327,
60(1)83,
60(3)297,
61(2)103,
62(0)3,
62(1)187,
62(3)289,
63(1)43,
63(3)253,
66(3)255,
66(3)289,
66(3)333,
68(3)303,
69(1)1