Characterizing EF and EX tree logics (Q2503041): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking for infinite-state concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order logic on finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding low levels of tree-automata hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251040 / rank
 
Normal rank

Latest revision as of 19:18, 24 June 2024

scientific article
Language Label Description Also known as
English
Characterizing EF and EX tree logics
scientific article

    Statements

    Identifiers