Entry Carpi:1988:SUA 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{Carpi:1988:SUA,
author = "Arturo Carpi",
title = "On synchronizing unambiguous automata",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "285--296",
month = dec,
year = "1988",
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 = "Univ di Napoli",
affiliationaddress = "Naples, Italy",
classification = "721; C4220 (Automata theory)",
corpsource = "Dipartimento di Matematica e Applicazioni, Naples
Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; polynomial upper
bound; Polynomial Upper Bounds; Shortest Word of
Minimal Rank; synchronizing; Synchronizing Pairs;
Synchronizing Unambiguous Automata; transition monoid;
unambiguous automata; Unambiguous Relations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bound,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
41(2)331,
43(2)201,
44(3)247,
45(1)63,
46(2)107,
46(2)329,
47(2)111,
47(2)149,
47(3)323,
49(2)171,
49(2)217,
52(3)239,
52(3)251,
54(2)325,
56(2)211,
57(1)97,
57(1)113,
58(1)175,
58(1)263,
61(2)149,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(1)1,
66(1)105,
66(2)137,
67(1)55,
67(1)115,
69(3)319
- minimal,
35(1)17,
35(2)261,
36(2)203,
36(2)345,
43(2)189,
50(2)183,
51(3)265,
58(1)17,
63(1)1,
67(1)65
- monoid,
35(2)179,
35(2)227,
35(2)271,
37(3)245,
38(1)123,
39(1)3,
40(1)13,
40(2)85,
41(1)121,
41(2)215,
43(1)117,
44(3)333,
46(2)159,
46(2)319,
47(2)191,
48(2)183,
48(2)329,
49(1)13,
51(1)215,
52(1)59,
54(2)165,
55(2)183,
56(3)345,
57(2)239,
58(1)81,
58(1)201,
64(3)271,
66(1)55,
66(2)117,
66(3)233,
67(1)19,
67(1)65,
67(2)143
- pair,
35(2)179,
39(2)337,
41(2)223,
51(1)27,
66(2)117,
67(2)203,
68(2)155
- rank,
61(2)299,
66(1)1
- 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,
61(2)137,
63(2)223,
64(1)83,
65(1)1,
65(3)343,
67(1)19,
67(1)65
- shortest,
53(2)201,
57(0)3,
57(1)131,
66(0)117,
66(2)157
- transition,
37(3)245,
38(1)133,
40(2)245,
46(2)285,
48(1)117,
48(2)135,
53(2)225,
59(1)25,
59(3)235,
63(1)19,
64(3)221
- unambiguous,
41(1)51,
47(1)107,
51(1)215,
52(1)59
- upper,
41(2)247,
46(2)107,
47(2)149,
49(2)217,
56(2)211,
58(1)263,
61(2)149,
66(1)1,
67(1)55
- word,
35(1)1,
35(1)115,
35(2)337,
38(1)117,
38(1)137,
39(2)281,
40(1)13,
41(1)61,
43(1)59,
44(1)107,
44(2)175,
44(2)199,
45(1)63,
47(2)191,
47(3)335,
48(1)35,
48(1)127,
52(1)1,
53(2)319,
54(2)139,
55(2)141,
56(2)233,
56(3)253,
56(3)339,
58(1)103,
58(1)231,
60(3)255,
61(1)1,
65(2)171,
65(2)221,
65(2)z,
69(3)319