Entry Seidl:1992:SVT 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{Seidl:1992:SVT,
author = "H. Seidl",
title = "Single-valuedness of tree transducers is decidable in
polynomial time",
journal = j-THEOR-COMP-SCI,
volume = "106",
number = "1",
pages = "135--181",
day = "30",
month = nov,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:15:15 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Fachbereich Inf., Univ. des Saarlandes, Saarbrucken,
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bottom-up finite-state tree transducer; decidability;
decidable; finite automata; finite-valuedness; input
tree; normalizing transformations; polynomial time;
single-valued; submonoid of trees; tree transducers;
trees (mathematics)",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- bottom-up,
74(3)273,
84(2)165,
105(1)27,
106(1)21,
124(1)93,
127(1)69
- 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(1)137,
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(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,
81(1)137,
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,
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
- finite-state,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(2)283,
108(1)83,
110(1)1,
113(1)93,
129(2)323,
134(1)225,
134(2)329
- input,
75(1)111,
79(1)163,
82(1)113,
92(1)3,
97(2)285,
98(2)347,
108(1)45,
108(2)271,
121(1)323,
128(1)127,
128(1)211,
134(1)225
- normalizing,
110(2)419
- Seidl, H.,
88(2)325
- single-valued,
134(1)225
- state, finite-,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(2)283,
108(1)83,
110(1)1,
113(1)93,
129(2)323,
134(1)225,
134(2)329
- submonoid,
73(3)329,
86(2)233,
108(2)237,
134(1)209,
134(2)537
- transducer,
78(2)267,
85(1)53,
93(1)43,
97(2)245,
106(2)183,
108(2)185,
116(2)305,
129(2)323,
134(1)107,
134(1)225,
134(2)311
- transformation,
70(1)35,
71(1)47,
73(2)121,
73(2)155,
73(2)231,
75(1)85,
75(1)139,
75(1)z,
76(1)115,
76(2)331,
77(1)97,
81(1)1,
81(2)295,
86(1)107,
86(1)z,
89(1)179,
90(1)37,
93(1)43,
94(1)141,
104(1)109,
105(1)57,
108(1)151,
108(1)z,
109(1)3,
109(1)145,
109(1)181,
109(1)257,
109(1)z,
110(2)377,
115(1)107,
115(2)291,
116(2)373,
120(2)169,
122(1)119,
123(1)139,
124(1)180,
124(2)221,
127(2)199,
128(1)99,
129(1)123,
136(1)57
- up, bottom-,
74(3)273,
84(2)165,
105(1)27,
106(1)21,
124(1)93,
127(1)69
- valued, single-,
134(1)225