Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3692869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong optimal lower bounds for Turing machines that accept nonregular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plus petit commun multiple des termes consécutifs d'une suite récurrente linéaire. (Least common multiple of consecutive terms of a linear recurrent sequence) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging across the \(\log(n)\) space frontier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic Bounds on Space and Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Families of Languages Related to ALGOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pushdown automaton or a context-free grammar - which is more economical? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity. I: Properties of a measure of descriptional complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777484 / rank
 
Normal rank

Revision as of 15:25, 5 June 2024

scientific article
Language Label Description Also known as
English
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
scientific article

    Statements

    Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    formal languages
    0 references
    context-free grammars
    0 references
    pushdown automata
    0 references
    descriptional complexity
    0 references
    space complexity.
    0 references

    Identifiers