A gap property of deterministic tree languages. (Q1401364): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Damian Niwinski / rank
Normal rank
 
Property / author
 
Property / author: Damian Niwinski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudiments of \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal mu-calculus alternation hierarchy is strict / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Rabin Index of a Parity Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology and descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818826 / 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: Hierarchies of weak automata and weak monadic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / 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: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borel hierarchy is infinite in the class of regular sets of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4158997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the rabin index of a regular language of infinite words / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:51, 6 June 2024

scientific article
Language Label Description Also known as
English
A gap property of deterministic tree languages.
scientific article

    Statements

    A gap property of deterministic tree languages. (English)
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    weak alternating automata
    0 references

    Identifiers