Finite automata and unary languages (Q1099644): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57380795, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a linear diophantine problem of Frobenius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounds for processing contentless inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some independent families of one-letter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple counter machines and number-theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape bounds for single letter alphabet language processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR DIOPHANTINE EQUATION WITH APPLICATIONS TO NON‐NEGATIVE MATRICES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / 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: Relating refined space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for separating space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4991691 / 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: On the maximal order in $S_n$ and $S*_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132619 / rank
 
Normal rank

Latest revision as of 15:19, 18 June 2024

scientific article
Language Label Description Also known as
English
Finite automata and unary languages
scientific article

    Statements

    Finite automata and unary languages (English)
    0 references
    0 references
    1986
    0 references
    unary language
    0 references
    deterministic finite automata
    0 references

    Identifiers