%0 Journal Article
%T Some notes on graph automata, tiling systems and partition logic<br>Some Notes on Graph Automata, TilingSystems and Partition Logic
%A Shen Enshao
%A <br>Shen
%A Enshao
%J 计算机科学技术学报
%D 1998
%I 
%X 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.
%K Graph automata
%K tiling systems
%K picture languages
%K partition logic<br>图形自动化
%K 贴砖系统
%K 分段逻辑
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=0BD724EC006C854F4B83BDDDD9216E65&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=B31275AF3241DB2D&sid=07C6E4664BB7C5DA&eid=F176272DD933A0BB&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=1&reference_num=14