Entry Weber:1994:FVD 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{Weber:1994:FVD,
author = "Andreas Weber",
title = "Finite-valued distance automata",
journal = j-THEOR-COMP-SCI,
volume = "134",
number = "1",
pages = "225--251",
day = "07",
month = nov,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=1&aid=1649",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
conflocation = "Kyoto, Japan; 25-28 Aug. 1992",
conftitle = "Second International Colloquium on Words, Languages
and Combinatorics",
corpsource = "Fachbereich Inf., Frankfurt Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cheapest successful computation; computational
complexity; deterministic double exponential time;
deterministic polynomial time; disjoint union; expense;
finite automata; finite state machines; finite-state
machines; finite-valued distance automata; input word;
maximal distance; PSPACE-complete problem;
single-valued distance automata; transducer; unary
output alphabet; valuedness",
pubcountry = "Netherlands",
sponsororg = "Kyoto Sangyo Univ",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alphabet,
71(3)381,
73(1)81,
73(3)279,
73(3)335,
76(2)261,
79(1)195,
81(1)147,
81(2)289,
83(2)287,
88(1)117,
92(1)33,
92(1)77,
92(1)87,
92(1)145,
95(2)187,
108(2)311,
108(2)345,
108(2)365,
113(1)35,
115(2)243,
115(2)359,
118(1)49,
123(1)61,
127(1)53,
131(2)311,
132(1)71,
132(1)415,
134(1)87,
134(1)209,
134(2)329
- complete, PSPACE-,
80(1)77,
84(1)127,
88(1)99,
97(2)199,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
131(2)243,
123(2)329
- disjoint,
76(1)53,
83(2)275,
91(2)239,
102(2)283,
103(1)107,
115(2)351,
117(1)187,
124(2)195,
126(1)31,
127(2)395,
129(2)369,
133(1)49,
136(2)333
- distance,
72(1)27,
81(1)137,
92(1)191,
95(2)231,
97(1)131,
102(2)253
- double,
108(2)251,
123(2)351
- exponential,
81(1)65,
81(2)169,
83(2)313,
84(1)77,
86(2)325,
94(2)295,
98(2)289,
106(2)351,
107(1)121,
108(2)291,
111(1)145,
116(1)33,
117(1)169,
131(2)331,
134(1)253,
134(2)545,
136(2)487
- finite-state,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(1)135,
106(2)283,
108(1)83,
110(1)1,
113(1)93,
129(2)323,
134(2)329
- finite-valued,
101(1)143
- input,
75(1)111,
79(1)163,
82(1)113,
92(1)3,
97(2)285,
98(2)347,
106(1)135,
108(1)45,
108(2)271,
121(1)323,
128(1)127,
128(1)211
- maximal,
70(1)73,
84(1)53,
87(1)209,
88(1)33,
88(1)59,
88(2)325,
89(2)207,
92(1)145,
92(1)191,
95(2)245,
101(2)239,
108(1)173,
108(2)345,
112(2)419,
122(1)49,
134(1)209
- output,
79(1)163,
108(2)271,
128(1)127,
128(1)211,
129(2)323
- PSPACE-complete,
80(1)77,
84(1)127,
88(1)99,
97(2)199,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
131(2)243
- single-valued,
106(1)135
- state,
76(2)285,
80(1)77,
82(2)253,
82(2)285,
84(2)281,
86(2)365,
87(1)43,
96(1)157,
96(1)z,
96(2)411,
101(2)161,
101(2)289,
103(2)191,
103(2)235,
113(1)93,
114(1)93,
119(2)267,
125(1)111,
125(2)315,
127(2)313,
129(2)323,
133(2)205,
135(2)377
- state, finite-,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(1)135,
106(2)283,
108(1)83,
110(1)1,
113(1)93,
129(2)323,
134(2)329
- successful,
79(1)151,
85(1)117
- transducer,
78(2)267,
85(1)53,
93(1)43,
97(2)245,
106(1)135,
106(2)183,
108(2)185,
116(2)305,
129(2)323,
134(1)107,
134(2)311
- unary,
82(1)151,
115(2)261,
120(1)123,
129(2)337,
131(2)441
- union,
74(3)325,
76(1)53,
76(2)273,
76(2)309,
77(3)291,
79(1)137,
88(2)351,
91(2)239,
97(2)217,
99(2)177,
110(1)99,
113(2)293,
116(1)33,
124(2)195,
126(1)31,
126(2)183,
131(2)311,
132(1)71,
136(2)333
- valued, finite-,
101(1)143
- valued, single-,
106(1)135
- Weber, Andreas,
134(1)253
- word,
71(3)281,
71(3)381,
72(1)27,
72(1)39,
72(1)55,
73(3)335,
74(1)3,
79(1)195,
79(1)241,
81(1)147,
81(2)305,
82(1)71,
83(2)301,
85(1)33,
86(2)277,
88(1)83,
88(2)365,
92(1)19,
93(2)227,
94(2)199,
94(2)367,
96(2)325,
96(2)405,
99(2)327,
100(1)67,
102(2)253,
106(2)327,
106(2)373,
106(2)395,
108(1)3,
108(1)17,
108(1)45,
108(1)103,
108(1)z,
108(2)251,
108(2)311,
108(2)357,
110(1)1,
112(2)187,
112(2)311,
115(1)43,
115(2)191,
115(2)243,
117(1)217,
119(2)267,
120(2)303,
123(1)55,
123(2)273,
126(2)237,
127(1)53,
129(2)263,
129(2)369,
131(2)271,
132(1)129,
132(1)415,
134(1)209,
134(1)z,
134(2)529,
136(2)361