Entry Chrobak:1986:FAU 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{Chrobak:1986:FAU,
author = "M. Chrobak",
title = "Finite automata and unary languages",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "149--158",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 05 09:19:14 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
note = "See errata \cite{Chrobak:2003:EFA}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1DFA; 2DFA; alternating automata; computational
complexity; deterministic automata; finite automata;
formal languages; lower bound; n-state 1NFA;
nondeterministic automata; one-way automata; state
complexity; tight bounds; two-way automata; unary
languages; upper bound",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alternating,
36(2)291,
41(2)305,
41(2)331,
54(2)267,
54(2)331,
58(1)263,
61(2)149,
63(2)203,
66(3)273,
67(1)75,
67(1)99,
68(1)19,
68(2)175
- 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(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,
60(3)285,
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
- Chrobak, M.,
36(2)341,
48(2)153
- Chrobak:1986:FAU,
302(1)497
- Chrobak:2003:EFA,
302(1)497
- deterministic,
35(2)215,
36(1)89,
37(1)1,
37(2)123,
38(1)133,
38(2)323,
40(1)31,
40(1)57,
41(2)223,
41(2)305,
41(2)325,
42(3)251,
43(2)123,
43(2)337,
44(1)111,
46(2)219,
47(1)39,
48(1)109,
48(1)117,
49(2)267,
52(1)77,
52(1)91,
52(3)269,
54(1)65,
61(1)25,
61(2)149,
64(1)39,
66(1)65,
66(3)273,
67(1)65
- errata,
302(1)497
- lower,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
43(2)201,
44(3)247,
46(2)329,
47(3)323,
49(2)171,
52(3)239,
52(3)251,
54(2)325,
57(1)97,
57(1)113,
58(1)263,
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(2)137,
67(1)115
- nondeterministic,
36(1)1,
36(1)21,
36(1)127,
37(1)1,
39(1)27,
39(2)89,
40(2)175,
40(2)211,
41(2)141,
41(2)305,
43(2)123,
45(1)1,
45(2)193,
47(2)111,
47(2)131,
47(3)335,
48(1)109,
48(2)153,
48(2)329,
49(2)87,
49(2)185,
51(3)325,
52(3)177,
52(3)307,
52(3)341,
54(2)331,
56(1)37,
58(1)69,
58(1)175,
58(1)249,
61(2)137,
61(2)149,
62(3)319,
63(2)203,
64(3)221,
67(1)111,
68(3)277
- one-way,
39(2)89,
47(3)263,
48(2)153,
57(2)225,
68(1)19
- See,
302(1)497
- state,
40(1)67,
40(2)245,
41(2)331,
44(1)69,
46(2)107,
48(1)117,
52(3)269,
55(2)291,
56(1)135,
63(1)91,
64(2)203,
64(3)271,
64(3)281,
64(3)305,
68(1)49,
68(3)253,
69(3)243
- tight,
47(3)323
- two-way,
35(1)115,
39(2)267,
44(1)111,
63(2)141,
66(3)273
- unary,
53(2)243,
302(1)497
- upper,
41(2)247,
46(2)107,
49(2)217,
56(2)211,
58(1)263,
60(3)285,
61(2)149,
66(1)1,
67(1)55
- way, one-,
39(2)89,
47(3)263,
48(2)153,
57(2)225,
68(1)19
- way, two-,
35(1)115,
39(2)267,
44(1)111,
63(2)141,
66(3)273