On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W40619283 / 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: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934755 / 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: WHEN CHURCH-ROSSER BECOMES CONTEXT FREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stateless deterministic restarting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct description of regular languages by weak restarting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of certain decision problems about congruential languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE POWER OF RRWW-AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarting Automata with Auxiliary Symbols and Small Lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularity test for pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Related Problems for Deterministic Pushdown Automata / rank
 
Normal rank

Latest revision as of 17:38, 5 July 2024

scientific article
Language Label Description Also known as
English
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
scientific article

    Statements

    On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (English)
    0 references
    0 references
    0 references
    20 September 2012
    0 references
    0 references
    restarting automaton
    0 references
    window size
    0 references
    descriptional complexity
    0 references
    non-recursive trade-off
    0 references
    0 references