Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
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{Er:1983:NGW,
author = "M. C. Er",
title = "A note on generating well-formed parenthesis strings
lexicographically",
journal = j-COMP-J,
volume = "26",
number = "3",
pages = "205--207",
month = aug,
year = "1983",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/26.3.205",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:15 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/26/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/26/3/205.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_03/tiff/205.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_03/tiff/206.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_03/tiff/207.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "723",
corpsource = "Dept. of Computing Sci., Univ. of Wollongong,
Wollongong, NSW, Australia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming; control structures; data
handling; data structures; formed parenthesis strings;
lexicographic order; ordered trees; recursive
algorithm; sortable permutations; stack-; trees
(mathematics); well-",
treatment = "P Practical",
}
Related entries
- 25-3-396b-396, 25-4-496a-496,
26(2)134,
26(2)175,
26(3)235,
26(3)282,
27(1)3,
27(1)62,
27(3)254,
28(3)216,
28(4)366,
28(5)487,
29(1)9,
29(1)12,
29(1)24,
29(1)33,
29(2)109,
29(2)118,
29(2)176,
29(3)229,
29(3)235,
29(3)241,
29(6)527,
30(1)20,
30(1)52,
30(2)157,
30(3)228,
30(3)249,
30(5)386,
30(5)437,
30(5)451,
30(6)487,
31(1)9,
31(3)209,
31(3)220,
31(6)503,
31(6)570,
32(2)162,
32(4)323,
32(4)362
- Er, M. C.,
25(1)93,
25(3)397,
25(4)442,
26(3)224,
26(4)293,
27(1)80,
27(2)171,
27(3)278,
27(3)285,
28(5)538,
28(5)543,
29(5)430,
30(3)282,
30(3)282-1,
30(6)569,
31(1)61,
31(3)283,
31(6)557,
32(1)76,
32(5)470
- formed, well-,
29(4)322
- generating,
23(1)73,
23(4)332,
25(2)257,
28(2)117,
28(4)433,
31(1)61,
31(3)283,
32(3)281,
32(5)470,
32(6)571
- handling,
23(2)147,
24(1)3,
24(1)17,
24(1)42,
24(2)97,
24(2)130,
25(3)347,
25(4)448,
25(4)486,
28(2)117,
29(5)477-1,
30(3)277,
30(6)569,
31(1)61,
31(2)133,
31(6)503,
31(6)553,
31(6)557,
31(6)561,
32(1)13,
32(1)16,
32(3)238,
32(3)241,
32(5)386,
32(6)494,
32(6)505
- lexicographic,
23(4)332,
26(1)92,
27(4)373,
28(4)444,
28(5)538,
30(3)282,
30(3)282-1,
30(6)569,
31(1)61,
31(1)65
- lexicographically,
28(5)538,
29(2)171
- mathematics,
23(2)161,
23(3)248,
23(3)256,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)224,
27(2)178,
27(2)184,
27(3)218,
27(3)225,
27(4)368-1,
28(1)73,
28(2)105,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
28(5)538,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- note,
24(3)278,
25(1)158,
25(1)159,
25(3)397,
26(1)93,
26(2)187,
26(2)187,
26(2)188-1,
26(3)282,
27(1)83,
27(1)84,
27(1)86,
27(1)87,
27(2)179,
27(3)283-1,
27(3)283-3,
27(3)284,
27(3)284-1,
27(4)373,
27(4)375,
27(4)376,
28(2)111,
28(3)343,
29(2)189-1,
29(4)378,
29(4)380-1,
29(5)477,
29(6)572,
29(6)573,
30(2)189,
30(3)276-1,
30(3)276-2,
30(3)282-1,
30(3)283,
30(4)376,
30(4)378,
31(3)285,
31(5)474,
31(6)564,
31(6)565,
31(6)567,
31(6)570,
32(1)13,
32(1)16,
32(1)90,
32(1)91,
32(1)93,
32(2)187,
32(3)281,
32(4)377,
32(5)474
- order,
23(2)186,
24(1)83,
24(2)180,
26(1)92,
26(3)224,
27(1)37,
27(4)373,
28(3)309,
30(3)282,
30(3)282-1,
30(5)425,
30(6)569,
31(1)61,
32(1)16,
32(2)98,
32(3)241,
32(5)461
- ordered,
23(2)161,
28(5)538,
30(6)487,
30(6)565,
31(6)564,
32(1)76
- permutation,
23(2)187,
23(4)344,
24(2)173,
25(2)257,
25(4)423,
26(1)92,
26(2)97,
27(2)176,
27(3)276,
27(4)373,
28(4)444,
30(3)282,
30(3)282-1,
30(5)433,
32(1)76,
32(4)362,
32(6)571
- recursive,
23(4)332,
25(2)231,
26(1)15,
27(2)171,
28(1)78,
29(2)161,
29(2)182,
29(6)531,
30(4)376,
31(3)229,
31(3)283,
31(4)358,
31(6)561,
31(6)565,
32(1)36,
32(3)281
- string,
23(1)37,
25(1)93,
25(1)114,
27(2)178,
29(6)486,
30(2)149,
32(3)228
- well-formed,
29(4)322