Aperiodicity in Tree Automata (Q3522867): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-automaton aperiodicity is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing CTL-like logics on finite trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order properties of trees, star-free expressions, and aperiodicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulo-counting quantifiers over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General varieties of tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221429 / rank
 
Normal rank

Latest revision as of 16:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Aperiodicity in Tree Automata
scientific article

    Statements