The complexity of compressing subsegments of images described by finite automata (Q1861562): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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: On the complexity of pattern matching for highly compressed two-dimensional texts. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata Computing Real Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On continuous functions computed by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic coding of weighted finite automata / rank
 
Normal rank

Latest revision as of 12:22, 5 June 2024

scientific article
Language Label Description Also known as
English
The complexity of compressing subsegments of images described by finite automata
scientific article

    Statements

    The complexity of compressing subsegments of images described by finite automata (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2003
    0 references
    square images
    0 references
    finite automata
    0 references
    complexity
    0 references

    Identifiers