Non-recursive trade-offs between two-dimensional automata and grammars (Q896688): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2173593318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of two-dimensional on-line tessellation acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Picture languages with array rewriting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expressions and context-free grammars for picture languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying approach to picture grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762794 / 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: Pushdown automata with bounded nondeterminism and bounded ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Measuring Non-Recursive Trade-Offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Non-Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional connected pictures are not recognizable by finite-state acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on three-way two dimensional alternating Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. / rank
 
Normal rank

Latest revision as of 04:21, 11 July 2024

scientific article
Language Label Description Also known as
English
Non-recursive trade-offs between two-dimensional automata and grammars
scientific article

    Statements

    Non-recursive trade-offs between two-dimensional automata and grammars (English)
    0 references
    0 references
    10 December 2015
    0 references
    picture languages
    0 references
    four-way automata
    0 references
    two-dimensional context-free grammars
    0 references
    descriptional complexity
    0 references
    non-recursive trade-offs
    0 references

    Identifiers