Entry Vagvolgyi:1993:FAC 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{Vagvolgyi:1993:FAC,
author = "S{\'a}ndor V{\'a}gv{\"o}lgyi",
title = "A fast algorithm for constructing a tree automaton
recognizing a congruential tree language",
journal = j-THEOR-COMP-SCI,
volume = "115",
number = "2",
pages = "391--399",
day = "19",
month = jul,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:23 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=115&issue=2;
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=1993&volume=115&issue=2&aid=1325",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Hungarian Acad. of Sci., Szeged, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "congruential tree language; deterministic automata;
fast algorithm; formal languages; ground term equation
system; recognizable tree languages; tree automaton",
pubcountry = "Netherlands",
treatment = "P Practical",
}
Related entries
- automaton,
76(2)223,
78(2)363,
79(1)151,
84(2)281,
88(1)117,
88(2)231,
91(1)57,
92(1)119,
92(1)181,
92(2)249,
93(2)227,
95(1)159,
96(2)305,
97(2)233,
97(2)245,
98(2)347,
106(1)61,
108(1)83,
116(2)305,
116(2)373,
119(2)233,
120(2)197,
123(2)199,
125(2)243,
125(2)315,
131(2)295,
134(1)253,
134(2)387,
136(2)291
- congruential,
123(2)397
- constructing,
99(2)213,
130(1)125
- equation,
71(3)381,
72(2)119,
74(3)329,
76(2)309,
79(1)179,
82(2)177,
87(1)1,
89(1)3,
90(1)127,
92(1)145,
103(2)165,
108(1)103,
115(1)77,
116(2)317,
119(1)39,
121(1)411,
123(1)145,
123(2)239,
123(2)397,
131(2)311,
132(1)71,
132(1)129,
133(1)23,
135(1)111,
135(2)319
- fast,
73(1)91,
81(1)97,
92(1)3,
92(1)165,
92(1)191,
92(1)z,
106(2)265,
116(2)421,
123(2)427,
130(1)17,
134(1)63
- ground,
74(2)227,
75(1)85,
75(1)111,
76(2)309,
86(1)81,
100(1)105,
106(1)87,
107(2)277,
127(1)69,
136(1)21
- recognizable,
74(2)239,
76(2)261,
77(3)237,
86(2)233,
86(2)325,
92(1)77,
93(2)169,
98(2)321,
108(1)173,
125(2)167,
126(1)53,
133(1)35,
134(2)311
- recognizing,
81(2)295,
120(2)261
- term,
72(2)133,
72(2)169,
72(2)225,
72(2)z,
73(2)177,
75(1)111,
75(1)157,
75(1)z,
76(2)261,
77(1)131,
78(2)267,
79(1)179,
80(1)1,
80(2)263,
80(2)303,
82(2)403,
83(1)3,
87(1)25,
90(2)369,
93(2)245,
94(1)1,
103(2)273,
105(2)217,
107(2)333,
109(1)7,
112(1)99,
114(2)273,
118(2)167,
121(1)279,
124(1)169,
124(2)297,
126(1)31,
131(1)29,
132(1)319,
134(2)311,
135(2)423,
136(2)333
- Vágvölgyi, Sándor,
127(1)69