Traces of term-automatic graphs (Q3526420): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5545522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Sensitive Languages, Rational Graphs and Determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of languages and linear-bounded automata / 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: Q4508307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of automata characterizing context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-sided and two-sided context in formal grammars / rank
 
Normal rank

Latest revision as of 17:42, 28 June 2024

scientific article
Language Label Description Also known as
English
Traces of term-automatic graphs
scientific article

    Statements

    Traces of term-automatic graphs (English)
    0 references
    0 references
    0 references
    25 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    graphs defined by term transducers
    0 references
    formal languages
    0 references
    infinite automata
    0 references
    tiling systems
    0 references
    0 references