Automaticity. II: Descriptional complexity in the unary case (Q1390867): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the number of cycles possible in digraphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Bounds for Primality Testing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Evidence for Small Generating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cube-free \(\omega\)-words generated by binary morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent circuits of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5339300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity. I: Properties of a measure of descriptional complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digraphs with no two disjoint directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665234 / rank
 
Normal rank

Latest revision as of 12:12, 28 May 2024

scientific article
Language Label Description Also known as
English
Automaticity. II: Descriptional complexity in the unary case
scientific article

    Statements

    Automaticity. II: Descriptional complexity in the unary case (English)
    0 references
    0 references
    0 references
    0 references
    22 July 1998
    0 references
    deterministic automaticity
    0 references
    languages
    0 references

    Identifiers