Entry Leung:1991:LTF 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{Leung:1991:LTF,
author = "H. Leung",
title = "Limitedness theorem on finite automata with distance
functions: an algebraic proof",
journal = j-THEOR-COMP-SCI,
volume = "81",
number = "1",
pages = "137--145",
day = "22",
month = apr,
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 = "Dept. of Comput. Sci., New Mexico State Univ., Las
Curces, NM, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic proof; computational complexity;
decidability; decidable; decision problem; distance
functions; exponential-time decision algorithm; finite
automata; nonnegative integer value; PSPACE-hard",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- decidable,
71(3)281,
74(1)3,
77(1)73,
78(2)347,
79(1)37,
79(1)263,
80(2)303,
82(1)19,
88(2)325,
89(1)33,
91(1)71,
94(1)1,
94(2)367,
95(1)115,
98(2)199,
103(1)39,
103(1)143,
106(1)135,
108(2)237,
109(1)83,
118(2)167,
120(2)229,
123(2)315,
126(1)113,
127(1)149,
129(2)419,
131(2)271,
131(2)431,
132(1)37,
132(1)129,
134(2)365
- decision,
71(3)281,
72(1)39,
72(2)265,
74(1)71,
80(2)227,
81(2)169,
82(1)19,
84(1)127,
84(2)199,
85(1)33,
93(2)279,
95(1)115,
98(1)137,
98(1)z,
106(2)351,
107(1)63,
110(2)419,
112(1)145,
112(2)371,
113(1)119,
118(2)193,
119(1)173,
120(2)197,
123(2)183,
125(2)339,
126(2)183,
127(1)25,
128(1)179,
133(2)307,
134(2)329,
134(2)365,
134(2)387,
135(1)139
- distance,
72(1)27,
92(1)191,
95(2)231,
97(1)131,
102(2)253,
134(1)225
- exponential-time,
80(2)203,
99(2)301,
113(1)55,
115(2)371,
129(2)309,
134(2)287
- hard, PSPACE-,
129(1)95
- integer,
78(2)357,
79(1)25,
94(2)223,
97(1)105,
100(1)67,
100(1)105,
106(2)183,
108(2)385,
112(2)391,
116(1)117,
120(2)215,
121(1)411,
123(1)95,
125(2)229,
127(2)287,
129(1)79,
129(2)263,
129(2)385,
132(1)337
- limitedness,
72(1)27
- PSPACE-hard,
129(1)95
- time, exponential-,
80(2)203,
99(2)301,
113(1)55,
115(2)371,
129(2)309,
134(2)287
- value,
73(1)61,
74(3)329,
77(1)161,
79(1)25,
117(1)187,
119(2)311,
129(1)79,
130(1)5,
132(1)387,
133(2)267