Entry Galil:1981:LTS 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{Galil:1981:LTS,
author = "Z. Galil and J. Seireras",
title = "Linear-time string-matching using only a fixed number
of local storage locations",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "331--336",
month = mar,
year = "1981",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math. Sci., Tel-Aviv Univ., Tel-Aviv,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata-theoretic terms; dynamic storage allocation;
finite automata; FORTRAN; linear-time string-matching
algorithm; local storage locations; programming theory;
random-access machine; restricted writing alphabet;
writing multihead finite automaton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- access, random-,
28(3)263
- allocation,
16(3)307,
22(1)71
- alphabet,
10(1)19,
14(1)63,
14(1)119,
16(2)187,
18(2)221,
19(3)231,
22(3)297,
22(3)331,
23(1)69,
23(1)83,
33(2)305,
33(2)327,
34(1)135
- automaton,
10(1)19,
18(1)33,
19(3)331,
21(1)39,
22(1)57,
23(1)37,
24(3)313,
26(1)221,
28(3)329,
30(2)205,
31(3)317,
32(3)227
- C4220,
10(1)19,
10(3)221,
10(3)249,
10(3)273,
11(2)167,
12(2)161,
12(3)333,
13(2)231,
13(3)295,
13(3)315,
13(3)323,
14(1)39,
14(1)63,
14(1)91,
14(2)155,
14(3)211,
15(2)117,
15(3)311,
16(1)75,
16(2)115,
16(2)187,
16(2)223,
17(1)99,
17(2)229,
17(3)333,
18(1)33,
18(2)207,
19(2)161,
19(2)219,
19(3)253,
19(3)305,
19(3)331,
21(1)27,
21(1)39,
21(2)145,
21(3)237,
21(3)255,
22(1)57,
22(1)219,
22(3)297,
23(1)37,
23(1)95,
23(1)103,
23(2)155,
23(2)217,
23(3)231,
23(3)287,
23(3)305,
23(3)333,
24(1)95,
24(1)105,
24(2)123,
24(2)179,
24(3)313,
24(3)331,
25(2)193,
25(3)221,
25(3)311,
26(1)1,
26(1)25,
26(1)197,
26(1)221,
26(1)225,
26(3)327,
26(3)343,
27(1)61,
27(1)121,
27(1)217,
28(1)1,
28(1)223,
28(3)263,
28(3)277,
28(3)315,
28(3)329,
29(1)87,
29(1)123,
30(2)205,
31(3)297,
31(3)317,
32(1)87,
32(1)201,
32(1)221,
32(3)227,
32(3)309,
32(3)321,
32(3)331,
32(3)339,
33(1)3,
33(2)261,
33(2)335,
34(1)157,
34(3)241,
34(3)255
- dynamic,
12(1)61,
14(1)113,
16(3)321,
17(2)193,
17(3)259,
17(3)343,
18(3)301,
21(2)145,
21(2)179,
27(1)127,
27(1)197,
27(3)333
- finite,
10(1)19,
10(2)187,
10(3)273,
11(2)167,
13(2)137,
13(3)323,
14(1)19,
14(1)39,
14(1)63,
14(2)195,
14(3)227,
15(2)201,
16(2)187,
16(2)223,
17(1)99,
17(3)333,
18(3)325,
19(3)231,
19(3)305,
20(2)95,
21(1)91,
21(2)225,
21(3)357,
22(1)19,
22(1)95,
22(3)285,
22(3)297,
23(1)83,
23(1)95,
23(2)155,
23(2)217,
23(3)339,
24(2)179,
24(3)331,
27(1)121,
27(1)217,
28(3)277,
28(3)287,
28(3)315,
28(3)329,
29(1)87,
29(1)185,
31(1)139,
31(3)297,
32(1)173,
32(1)201,
32(3)249,
32(3)321,
33(2)239,
33(2)261,
33(2)335,
34(1)135
- fixed,
10(1)93,
12(3)229,
14(1)63,
16(2)211,
18(3)333,
24(1)73,
26(1)53,
26(1)149,
29(1)167,
29(3)309
- Galil, Z.,
14(1)103,
21(1)39
- linear-time,
25(2)171
- local,
12(3)265,
21(2)145,
24(1)1,
32(1)1
- location,
16(3)329
- multihead,
21(2)145,
27(1)121
- number,
10(2)133,
11(2)207,
11(3)303,
12(1)97,
14(3)211,
14(3)227,
14(3)247,
15(3)279,
18(1)105,
18(3)259,
22(1)19,
22(3)331,
23(1)37,
23(1)69,
23(2)211,
23(3)287,
29(3)325,
31(1)61,
31(1)101,
31(1)125,
31(1)139,
33(1)85
- random-access,
28(3)263
- restricted,
13(1)61,
17(1)1,
22(1)175,
26(1)197,
28(3)299
- storage,
12(3)315,
13(3)315,
16(3)307,
19(1)69,
19(3)253,
22(1)71,
28(3)263,
34(1)157,
34(1)215
- term,
15(3)329,
22(1)1,
24(1)73,
32(1)1,
33(2)139,
33(2)175,
34(1)33,
34(1)227
- time, linear-,
25(2)171
- using,
12(1)61,
19(3)321,
21(1)75,
22(1)195,
23(3)305,
24(2)143,
30(1)1,
33(1)107
- writing,
32(3)249