Alternating automata, the weak monadic theory of trees and its complexity (Q1193871): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David E. Muller / rank
 
Normal rank
Property / author
 
Property / author: Ahmed Saoudi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation and \(\omega\)-type Turing acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternating \(\omega\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134970 / rank
 
Normal rank
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references