On Simulation Cost of Unary Limited Automata (Q5500689): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Converting two-way nondeterministic unary automata into simpler automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of context-free determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size complexity of rotating and sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of operations on two-way finite automata over a unary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing unary nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIMITED AUTOMATA AND REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited Automata and 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: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight-Reducing Hennie Machines and Their Descriptional Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal order in $S_n$ and $S*_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank

Latest revision as of 15:55, 10 July 2024

scientific article; zbMATH DE number 6471675
Language Label Description Also known as
English
On Simulation Cost of Unary Limited Automata
scientific article; zbMATH DE number 6471675

    Statements

    On Simulation Cost of Unary Limited Automata (English)
    0 references
    0 references
    0 references
    7 August 2015
    0 references
    0 references
    0 references