Entry Pomerance:1997:AID from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Pomerance:1997:AID,
author = "Carl Pomerance and John Michael Robson and Jeffrey
Shallit",
title = "Automaticity {II}: {Descriptional} complexity in the
unary case",
journal = j-THEOR-COMP-SCI,
volume = "180",
number = "1--2",
pages = "181--201",
day = "10",
month = jun,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=180&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=180&issue=1-2&aid=2360",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240C (Computational
complexity)",
corpsource = "Dept. of Math., Georgia Univ., Athens, GA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; descriptional complexity;
deterministic automata; deterministic automaticity;
finite alphabets; finite automata; finite-state
machine; nonregular languages; unary q-state NFAs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alphabet,
141(1)163,
143(2)269,
143(2)353,
145(1)317,
147(1)19,
147(1)31,
154(1)57,
154(2)225,
154(2)387,
155(2)425,
164(1)277,
174(1)157,
174(1)171,
177(2)425,
178(1)1,
180(1)81,
186(1)135,
195(1)91,
197(1)235,
209(1)163,
210(2)245
- automaticity,
188(1)195
- case,
137(1)159,
141(1)195,
145(1)189,
147(1)267,
164(1)59,
165(2)311,
166(1)221,
176(1)39,
176(1)67,
181(1)3,
183(2)157,
191(1)245,
201(1)171,
210(2)341
- descriptional,
180(1)353
- deterministic,
138(2)273,
138(2)315,
142(1)59,
143(1)159,
143(2)269,
143(2)285,
145(1)391,
150(1)111,
152(2)219,
154(1)23,
154(2)183,
154(2)225,
156(1)71,
157(2)259,
157(2)273,
158(1)221,
159(1)43,
161(1)141,
161(1)301,
163(1)193,
165(2)275,
165(2)355,
165(2)475,
167(1)171,
168(1)39,
168(2)241,
170(1)209,
172(1)135,
178(1)1,
179(1)251,
180(1)217,
182(1)233,
183(2)281,
185(1)15,
185(1)63,
187(1)105,
190(1)41,
190(1)61,
191(1)37,
191(1)61,
192(1)55,
194(1)57,
194(1)163,
194(1)240-2,
195(1)3,
197(1)95,
198(1)99,
215(1)191,
225(1)1
- finite-state,
138(1)141,
139(1)315,
146(1)109,
152(2)251,
163(1)193,
170(1)445,
178(1)237,
189(1)1
- II,
139(1)69,
141(1)109,
159(2)191,
170(1)1,
194(1)242,
194(1)248,
203(2)205,
216(1)311,
221(1)77
- NFAs,
178(1)1
- nonregular,
168(2)241,
221(1)211
- Shallit, Jeffrey,
163(1)193
- state, finite-,
138(1)141,
139(1)315,
146(1)109,
152(2)251,
163(1)193,
170(1)445,
178(1)237,
189(1)1
- unary,
146(1)243,
160(1)305,
167(1)171,
184(1)145,
206(1)317,
216(1)311,
216(1)363