Entry Cho:1991:FAA from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Cho:1991:FAA,
author = "Sang Cho and Dung T. Huynh",
title = "Finite-automaton aperiodicity is {PSPACE-complete}",
journal = j-THEOR-COMP-SCI,
volume = "88",
number = "1",
pages = "99--116",
day = "30",
month = sep,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Texas Univ., Richardson, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; dot-depth-one language
recognition; exact complexity; finite automata;
finite-automaton aperiodicity; formal languages;
logspace-complete; NL; nondeterministic
logspace-bounded Turing machines; piecewise testable
language recognition",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- automaton, finite-,
119(1)215
- complete, logspace-,
116(1)95
- complete, PSPACE-,
80(1)77,
84(1)127,
97(2)199,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
131(2)243,
134(1)225,
123(2)329
- exact,
73(1)61,
79(1)37,
92(1)19,
102(2)283,
103(1)107,
117(1)187,
125(1)111
- finite-automaton,
119(1)215
- Huynh, Dung T.,
123(2)183,
131(2)441
- logspace-complete,
116(1)95
- NL,
129(2)323
- nondeterministic,
74(1)115,
74(2)217,
75(3)289,
77(3)221,
78(1)137,
81(2)317,
82(1)141,
82(2)389,
84(2)165,
85(1)53,
85(2)305,
88(1)1,
88(1)15,
88(2)269,
88(2)297,
90(1)151,
91(2)129,
93(1)43,
97(2)183,
101(1)99,
101(2)161,
103(1)3,
106(2)351,
107(1)95,
107(2)305,
108(2)393,
115(2)225,
118(1)49,
118(1)67,
119(1)215,
120(1)123,
120(2)197,
125(2)243,
125(2)295,
127(1)171,
129(2)323,
129(2)337,
132(1)319,
133(1)3,
133(2)341,
134(1)253,
134(2)545,
135(1)139
- piecewise,
123(1)61
- PSPACE-complete,
80(1)77,
84(1)127,
97(2)199,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
131(2)243,
134(1)225
- recognition,
80(1)53,
81(2)311,
85(1)53,
85(1)171,
92(1)19,
92(1)33,
92(1)77,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
98(2)289,
106(1)21,
107(2)349,
112(1)53,
115(2)291,
116(1)117,
116(2)421,
123(2)427,
129(2)337,
132(1)403,
132(1)435,
136(2)291,
136(2)387
- testable,
84(2)225,
88(1)33