129:
153:
122:
33:
148:
25:
115:
44:
The emptiness problem (deciding whether the language of an input ATA is empty) and the universality problem for ATAs are
95:
29:
48:. The membership problem (testing whether an input tree is accepted by an input AFA) is in PTIME.
66:
H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison et M. Tommasi,
99:
45:
17:
142:
70:
103:
62:
60:
123:
8:
130:
116:
68:Tree Automata Techniques and Applications
56:
72:(Theorem 7.5.1 and subsequent remark)
7:
83:
81:
154:Theoretical computer science stubs
102:. You can help Knowledge (XXG) by
14:
34:nondeterministic finite automaton
26:nondeterministic tree automaton
1:
96:theoretical computer science
30:alternating finite automaton
170:
80:
22:alternating tree automaton
24:(ATA) is an extension of
40:Computational complexity
149:Automata (computation)
98:–related article is a
111:
110:
161:
132:
125:
118:
87:P ≟ NP
82:
73:
64:
46:EXPTIME-complete
169:
168:
164:
163:
162:
160:
159:
158:
139:
138:
137:
136:
89:
78:
76:
65:
58:
54:
42:
18:automata theory
12:
11:
5:
167:
165:
157:
156:
151:
141:
140:
135:
134:
127:
120:
112:
109:
108:
91:
85:
75:
74:
55:
53:
50:
41:
38:
13:
10:
9:
6:
4:
3:
2:
166:
155:
152:
150:
147:
146:
144:
133:
128:
126:
121:
119:
114:
113:
107:
105:
101:
97:
92:
88:
84:
79:
71:
69:
63:
61:
57:
51:
49:
47:
39:
37:
35:
31:
27:
23:
19:
104:expanding it
93:
86:
77:
67:
43:
21:
15:
28:as same as
143:Categories
52:References
32:extends
36:(NFA).
90:
94:This
20:, an
100:stub
16:In
145::
59:^
131:e
124:t
117:v
106:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.