Entry Nijholt:1983:SLI from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Nijholt:1983:SLI,
author = "A. Nijholt",
title = "On satisfying the {LL-iteration} theorem",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "91--94",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Informatics, Katholieke Univ. Nijmegen,
Nijmegen, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; iteration theorem; iterative
methods; J. C. Beatty; LL-languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C,
31(1)151,
32(1)201
- context-free,
11(1)107,
12(2)127,
12(3)265,
14(3)227,
14(3)337,
16(1)61,
16(3)237,
16(3)291,
17(1)1,
17(1)43,
18(1)33,
19(1)29,
19(3)231,
21(1)75,
22(1)209,
22(3)253,
23(1)83,
23(2)129,
23(2)155,
23(2)217,
23(3)231,
24(2)195,
26(1)233,
27(1)197,
27(3)287,
27(3)311,
28(1)197,
28(3)277,
28(3)299,
29(1)41,
29(3)277,
29(3)285,
29(3)325,
31(1)1,
31(1)139,
31(1)211,
31(3)227,
31(3)317,
31(3)337,
32(1)47,
32(3)261,
33(1)3,
33(2)305,
34(3)255
- free, context-,
11(1)107,
12(2)127,
12(3)265,
14(3)227,
14(3)337,
16(1)61,
16(3)237,
16(3)291,
17(1)1,
17(1)43,
18(1)33,
19(1)29,
19(3)231,
21(1)75,
22(1)209,
22(3)253,
23(1)83,
23(2)129,
23(2)155,
23(2)217,
23(3)231,
24(2)195,
26(1)233,
27(1)197,
27(3)287,
27(3)311,
28(1)197,
28(3)277,
28(3)299,
29(1)41,
29(3)277,
29(3)285,
29(3)325,
31(1)1,
31(1)139,
31(1)211,
31(3)227,
31(3)317,
31(3)337,
32(1)47,
32(3)261,
33(1)3,
33(2)305,
34(3)255
- iteration,
10(3)317,
12(2)193,
16(3)321,
19(1)29,
21(3)269,
22(1)195,
23(1)49,
23(3)243,
24(1)21,
26(1)53,
29(1)185
- iterative,
12(2)193,
19(1)29,
22(1)195,
23(2)187,
24(1)1,
25(1)1,
25(1)67,
28(3)287,
32(3)227,
33(2)175
- J,
21(2)231,
29(3)277,
32(1)201
- method,
10(1)53,
11(3)341,
12(1)97,
12(2)193,
12(3)315,
13(2)175,
13(3)239,
17(1)99,
17(3)259,
19(1)29,
22(1)195,
23(2)211,
24(1)1,
25(1)67,
27(1)167,
27(3)241,
28(3)287,
29(1)27,
30(2)139
- theorem,
10(1)53,
10(3)317,
11(3)247,
11(3)277,
12(2)193,
12(3)291,
15(2)159,
16(2)223,
17(3)279,
18(3)259,
18(3)333,
20(2)95,
20(3)265,
21(1)75,
22(1)1,
22(1)127,
23(1)1,
23(1)49,
29(1)167,
31(1)41,
31(1)125,
32(1)47,
32(1)221,
32(3)297,
33(2)175,
34(1)3,
34(1)17