Converting two-way nondeterministic unary automata into simpler automata. (Q1401239): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57380802 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way automaton computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way deterministic finite automata are exponentially more succinct than sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the reduction of two-way automata to one-way automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:48, 6 June 2024

scientific article
Language Label Description Also known as
English
Converting two-way nondeterministic unary automata into simpler automata.
scientific article

    Statements

    Converting two-way nondeterministic unary automata into simpler automata. (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    Formal languages
    0 references
    Finite state automata
    0 references
    Unary languages
    0 references

    Identifiers