Entry Kobayashi:1978:MFT from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Kobayashi:1978:MFT,
author = "K. Kobayashi",
title = "On the minimal firing time of the firing squad
synchronization problem for polyautomata networks",
journal = j-THEOR-COMP-SCI,
volume = "7",
number = "2",
pages = "149--167",
month = oct,
year = "1978",
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/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; finite automaton; firing squad
synchronisation problem; minimal firing time;
polyautomata networks",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- automata,
1(1)77,
1(2)95,
1(4)269,
1(4)297,
1(4)317,
2(1)1,
2(1)29,
2(1)49,
2(1)115,
2(2)147,
2(2)155,
2(3)271,
3(2)173,
3(2)213,
3(2)243,
3(2)261,
3(3)305,
4(2)143,
4(3)245,
5(2)101,
5(2)183,
6(1)1,
6(1)25,
6(2)175,
7(1)25,
7(2)185,
7(3)311,
7(3)333,
8(2)227,
8(2)239,
8(2)255,
9(1)127,
9(1)141,
9(2)221,
9(2)311,
9(2)385
- automaton,
1(2)95,
2(3)271,
5(2)101,
5(2)183
- C4220,
1(1)77,
1(2)95,
1(4)269,
1(4)297,
1(4)317,
2(1)1,
2(1)29,
2(1)49,
2(1)115,
2(2)147,
2(2)155,
2(3)271,
3(2)173,
3(2)213,
3(2)243,
3(2)261,
3(3)305,
4(2)143,
4(3)245,
5(2)101,
5(2)183,
6(1)1,
6(1)25,
6(2)175,
7(2)185,
7(3)311,
7(3)333,
8(2)227,
8(2)239,
8(2)255,
9(1)127,
9(1)141,
9(2)221,
9(2)311
- finite,
1(1)59,
1(2)95,
2(1)29,
2(3)271,
2(3)323,
3(2)261,
3(3)305,
5(2)101,
5(2)183,
5(2)205,
6(2)175,
7(2)211,
7(3)287,
8(1)69,
8(3)271,
9(2)221,
9(2)311
- firing,
3(1)85
- minimal,
1(2)95,
2(1)73,
3(2)173,
9(2)243
- networks,
1(1)13,
1(2)161,
9(1)147
- problem,
1(1)77,
1(3)237,
1(4)297,
2(1)77,
2(3)361,
3(1)1,
3(1)75,
3(1)85,
3(1)105,
3(2)123,
3(2)183,
3(3)283,
3(3)293,
4(1)99,
4(2)137,
4(3)237,
4(3)245,
4(3)277,
5(2)179,
6(1)93,
6(2)223,
6(3)317,
7(1)25,
7(2)169,
8(1)1,
8(1)89,
8(2)135,
8(2)189,
9(2)173,
9(2)377
- synchronisation,
1(2)95
- synchronization,
1(2)95,
8(3)379
- time,
1(2)103,
1(3)215,
1(4)269,
3(1)1,
3(1)23,
3(1)61,
3(1)105,
3(3)305,
6(1)93,
7(2)185,
7(3)273,
8(1)45,
8(2)189,
8(2)239