The finite graph problem for two-way alternating automata. (Q1874281): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal languages and bounded fragments of predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Restraining Power of Guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loosely guarded fragment of first-order logic has the finite model property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / 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: Alternating tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00866-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2658457120 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:52, 30 July 2024

scientific article
Language Label Description Also known as
English
The finite graph problem for two-way alternating automata.
scientific article

    Statements

    Identifiers

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