Alternating automata, the weak monadic theory of trees and its complexity (Q1193871): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90076-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087756506 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternating automata, the weak monadic theory of trees and its complexity |
scientific article |
Statements
Alternating automata, the weak monadic theory of trees and its complexity (English)
0 references
27 September 1992
0 references
Full version of the authors' paper in Lect. Notes Comput. Sci. 226, 275- 283 (1986; Zbl 0617.03020).
0 references
automata on trees
0 references
alternating automata
0 references
weak monadic logic
0 references
alternations of quantifiers
0 references
