Entry Saito:1989:SBE from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
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{Saito:1989:SBE,
author = "Takashi Saito and Hidenosuke Nishio",
title = "Structural and behavioral equivalence relations in
automata networks",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "223--237",
month = feb,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Kyoto Univ",
affiliationaddress = "Kyoto, Jpn",
classification = "721; 921; C1160 (Combinatorial mathematics); C4220
(Automata theory)",
corpsource = "Dept. of Biophys., Kyoto Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Networks; automata networks; Automata Theory;
Behavioral Equivalence; behavioural equivalence
relations; Directed Graphs; directed graphs;
edge-label; finite automata; Finite Automata; finite
automaton; Mathematical Techniques--Graph Theory;
Structural Equivalence; structural equivalence;
vertex-labeled directed graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "Structural and behavioural equivalence relations in
automata networks",
}
Related entries
- automaton,
35(1)17,
35(2)313,
36(2)291,
38(1)1,
38(1)133,
39(2)171,
40(1)31,
40(2)149,
40(2)163,
47(1)95,
47(3)335,
48(1)117,
53(2)307,
60(3)341,
61(1)17,
63(2)141,
65(2)123,
66(3)273,
67(1)65
- behavioral,
63(1)19
- behavioural,
63(1)19
- directed,
39(2)155,
40(2)149,
41(2)141,
41(2)185,
43(1)99,
44(3)275,
44(3)307,
45(3)261,
47(2)205,
47(3)315,
48(2)273,
52(1)37,
52(1)155,
55(1)87,
56(2)223,
58(1)325,
60(1)1,
61(2)175,
61(2)307,
64(2)191
- equivalence,
35(1)43,
35(2)313,
36(1)21,
36(1)113,
37(2)151,
37(2)183,
38(2)157,
39(1)27,
39(1)z,
41(1)105,
41(2)223,
42(1)1,
43(2)213,
44(2)237,
46(2)107,
46(2)175,
46(2)305,
47(1)39,
47(1)71,
47(3)247,
47(3)263,
47(3)299,
48(2)145,
48(2)329,
49(2)185,
49(2)z,
50(3)241,
52(1)77,
52(3)177,
52(3)307,
53(1)67,
53(2)225,
58(1)183,
59(1)115,
63(1)19,
64(1)39,
64(3)221,
66(1)1,
67(1)65
- Graph, Techniques-,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159,
67(1)5
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- network,
36(1)59,
36(1)119,
37(2)183,
38(1)133,
39(2)319,
40(2)101,
40(2)275,
41(1)19,
43(2)277,
44(1)69,
44(3)247,
47(1)15,
47(3)323,
48(1)75,
48(2)135,
49(2)171,
49(2)z,
52(3)193,
53(2)281,
54(1)53,
57(1)97,
58(1)183,
61(1)49,
61(2)175,
64(1)83,
64(1)125,
64(2)191,
64(2)203,
66(1)15,
68(1)19
- relation,
37(2)151,
38(2)157,
39(2)89,
40(2)131,
41(1)81,
46(2)159,
47(1)39,
47(3)329,
48(2)145,
51(1)215,
53(1)3,
54(2)277,
56(1)59,
57(2)303,
59(1)25,
59(3)287,
60(3)285,
61(2)137,
64(1)83,
65(1)1,
65(3)343,
67(1)19,
67(1)65
- structural,
52(1)15,
59(3)317,
61(2)103,
62(1)3
- Techniques--Graph,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159,
67(1)5