We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Shen Enshao. Some Notes on Graph Automata, TilingSystems and Partition Logic[J]. Journal of Computer Science and Technology, 1998, 13(6): 483-489.
Citation: Shen Enshao. Some Notes on Graph Automata, TilingSystems and Partition Logic[J]. Journal of Computer Science and Technology, 1998, 13(6): 483-489.

Some Notes on Graph Automata, TilingSystems and Partition Logic

More Information
  • Published Date: November 09, 1998
  • Introduce heuristically the newly definitioll (W. Thomas) for graph automata - using"tiles" to simulste the extension (over dag's) of the classical notions of transition moves; proposea sufficient condition for when graph automata can be reduced to (simpler) tiling systerms, whichis a generalisation of a Thomas' result; and finally study the logic sepcification of tiling systems(paticularly, over picture languages) by (existential) monadic partition logic, instead of theususal and stronger framework (E)MSQ.
  • [1]
    Blum M, Hewitt C. Automata on a two-dimensional tape. IEEE Symposium on Switching and Automata Theory, 1967, pp:155-160.
    [2]
    Thomas W. Finite-state recognizability and logic: From words to graphs. In 13th World Computer Congress 94, 1994, 1: 499-506, Elsevier.
    [3]
    Thomas W. On logics tilings and automata. LNCS, 1991, 510: 441-453. ……….

Catalog

    Article views (16) PDF downloads (1408) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return