THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size/lookahead tradeoff for \(LL(k)\)-grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unsolvability of the Recognition of Linear Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Succinctness of Different Representations of Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Goedel speed-up and succinctness of language representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown automata with bounded nondeterminism and bounded ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the descriptional power of heads, counters, and pebbles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing degree of the inherent ambiguity problem for context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of Descriptions of Unambiguous Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularity test for pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the succinctness of descriptions of deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i> + 1 Heads Are Better than <i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:44, 11 June 2024

scientific article; zbMATH DE number 2228599
Language Label Description Also known as
English
THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
scientific article; zbMATH DE number 2228599

    Statements

    THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (English)
    0 references
    0 references
    14 November 2005
    0 references
    descriptional complexity
    0 references
    multihead finite automata
    0 references

    Identifiers