Picture codes (Q3423135): Difference between revisions

From MaRDI portal
← Older edit
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Bots
1,895,659 edits
‎Changed an Item
 
Property / cites work
 
Property / cites work: Polyomino tilings, cellular automata and codicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A codicity undecidable problem in the plane. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3431476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-sensitive string languages and recognizable picture languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable picture languages and domino tiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of recognizable picture languages by tilings by finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite arrays and infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite arrays and controlled deterministic table 0L array systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free picture expressions are strictly weaker than first-order logic / rank
 
Normal rank

Latest revision as of 15:06, 25 June 2024

scientific article
Language Label Description Also known as
English
Picture codes
scientific article

    Statements

    title
    Picture codes (English)
    0 references
    DOI
    10.1051/ita:2006038
    0 references
    publication date
    20 February 2007
    0 references
    zbMATH DE Number
    5129053
    0 references
    zbMATH Keywords
    picture series
    0 references
    OpenAlex ID
    W4232911370
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3423135&oldid=34923230"
    Powered by MediaWiki