Entry Beynon:1980:SFF 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{Beynon:1980:SFF,
author = "W. M. Beynon",
title = "On the structure of free finite state machines",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "167--180",
month = jun,
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Warwick, Coventry,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Abelian groups; disjoint copies; finite automata;
finite semigroups; free finite state machines;
necessary and sufficient conditions; transition monoid
machine; universal presentation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Abelian,
25(3)267
- C4220,
10(1)19,
10(3)221,
10(3)249,
10(3)273,
12(2)161,
12(3)333,
13(2)231,
13(3)295,
13(3)315,
13(3)323,
13(3)331,
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
- condition,
10(1)37,
22(1)175,
26(3)287,
27(1)109,
28(3)277,
28(3)287,
31(3)297,
32(3)321
- disjoint,
14(1)119
- finite,
10(1)19,
10(2)187,
10(3)273,
13(2)137,
13(3)323,
13(3)331,
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
- free,
11(1)107,
11(2)123,
12(2)127,
12(3)265,
12(3)291,
12(3)325,
13(2)137,
16(1)25,
16(1)93,
17(3)343,
18(3)279,
23(1)83,
25(2)95,
28(3)329,
29(3)285,
30(1)133,
31(3)227,
32(1)61,
32(3)279
- group,
11(2)207,
14(1)1,
16(1)93,
18(3)325,
21(1)91,
25(3)267,
32(1)61,
32(1)201,
32(3)249,
32(3)279,
33(2)327,
33(2)331
- monoid,
12(3)325,
13(2)137,
14(2)195,
16(1)61,
17(2)229,
18(3)279,
18(3)325,
23(1)83,
24(3)301,
25(2)95,
28(3)329,
29(3)277,
29(3)285,
30(1)133,
32(1)201,
32(3)249,
33(2)331
- necessary,
27(1)109,
28(3)277,
28(3)287,
31(3)297
- presentation,
27(1)39,
32(3)249,
33(2)331,
34(1)17
- semigroup,
16(1)93,
18(2)221,
21(2)225,
32(1)201,
33(2)327
- state,
13(1)45,
14(3)211,
17(1)99,
18(1)33,
23(1)95,
23(2)107,
23(2)155,
24(2)179,
29(1)87,
32(1)25
- structure,
11(2)145,
12(2)175,
12(3)265,
13(1)61,
13(1)85,
14(1)1,
15(2)181,
16(3)279,
17(1)43,
17(3)303,
17(3)317,
17(3)343,
18(2)207,
20(1)3,
20(2)95,
20(3)209,
20(3)265,
21(3)281,
22(1)95,
22(3)297,
23(2)155,
24(1)1,
24(1)35,
25(1)1,
27(3)255,
29(1)75,
29(1)87,
30(2)139,
31(1)31,
31(3)227,
32(1)77,
33(1)95,
33(1)107,
33(1)z,
33(2)139,
33(2)195,
34(1)33,
34(3)289,
34(3)343
- sufficient,
27(1)109,
28(3)287,
31(3)297
- transition,
13(1)85,
14(3)317,
18(3)227,
31(1)83,
34(1)33
- universal,
16(1)93,
19(2)143,
22(1)19,
23(3)305,
26(3)327,
32(1)185