Real functions computable by finite automata using affine representations. (Q1607295): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of real number representations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A domain-theoretic approach to computability on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real functions defined by transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On continued fractions and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine mappings defined by finite transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217582 / rank
 
Normal rank

Revision as of 12:17, 4 June 2024

scientific article
Language Label Description Also known as
English
Real functions computable by finite automata using affine representations.
scientific article

    Statements

    Real functions computable by finite automata using affine representations. (English)
    0 references
    0 references
    31 July 2002
    0 references
    Real number computation
    0 references
    Finite automaton
    0 references
    Affine representation
    0 references
    Sub-self-similarity
    0 references
    Piecewise affine function
    0 references

    Identifiers