Entry Ehrig:1980:PCG 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{Ehrig:1980:PCG,
author = "H. Ehrig and B. K. Rosen",
title = "Parallelism and concurrency of graph manipulations",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "247--275",
month = jul,
year = "1980",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Fachbereich Informatik, Tech. Univ. Berlin, Berlin,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church Rosser theorem; concurrency; grammars; graph
derivation sequence; graph grammar theory; graph
manipulations; graph theory; parallelism; pullback
lemmas; sequential independence",
pubcountry = "Netherlands",
treatment = "P Practical",
}
Related entries
- C1160,
11(1)39,
11(1)93,
11(2)117,
11(2)123,
12(1)83,
13(2)137,
13(3)315,
14(1)103,
15(1)1,
15(2)159,
15(3)321,
16(1)5,
17(1)29,
17(1)75,
17(1)91,
17(1)103,
17(2)151,
17(2)217,
18(1)89,
18(2)115,
18(3)259,
19(1)1,
19(1)17,
19(1)29,
19(1)69,
19(2)189,
21(1)55,
21(1)91,
21(1)99,
22(3)233,
22(3)253,
22(3)331,
23(1)37,
23(1)83,
23(2)129,
23(2)211,
23(3)231,
23(3)243,
23(3)273,
24(2)143,
24(2)161,
25(2)95,
25(3)311,
28(1)171,
29(1)49,
29(1)75,
29(3)251,
30(3)241,
31(1)31,
31(1)61,
31(1)73,
31(3)307,
32(1)1,
32(1)87,
32(1)121,
32(1)173,
32(1)185,
32(1)215,
32(3)227,
32(3)309,
33(2)239,
34(1)3,
34(1)17,
34(1)33,
34(1)83,
34(1)169,
34(3)275,
34(3)337,
34(3)343
- concurrency,
13(1)61,
13(1)85,
25(3)221,
29(1)87,
34(1)33,
34(1)83
- derivation,
12(2)193,
19(2)117,
31(1)211
- Ehrig, H.,
20(3)209,
27(3)255,
28(1)45
- independence,
12(2)119,
23(2)107
- lemma,
14(1)119,
29(1)41,
32(3)331
- manipulation,
18(1)41
- parallelism,
18(1)1,
24(2)123
- sequence,
10(1)107,
12(3)339,
13(1)45,
14(2)127,
14(3)247,
15(2)213,
16(2)211,
18(3)279,
25(3)311,
26(3)301,
29(3)285,
31(1)125,
31(1)139,
32(1)25,
32(3)321
- sequential,
10(1)19,
12(1)39,
19(2)219,
20(3)265,
23(1)95,
24(2)131,
29(1)87,
32(1)25,
32(3)227,
33(2)279,
34(1)135
- theorem,
10(1)53,
10(3)317,
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,
23(1)91,
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