A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some classifications of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and computational complexity of systolic trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of variables is equivalent to space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars and systems of language equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of linear conjunctive grammars and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of nonterminals in linear conjunctive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588675 / rank
 
Normal rank

Latest revision as of 12:44, 11 June 2024

scientific article; zbMATH DE number 2228601
Language Label Description Also known as
English
A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS
scientific article; zbMATH DE number 2228601

    Statements

    A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (English)
    0 references
    0 references
    14 November 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    decision problem
    0 references
    descriptive complexity
    0 references