摘要
本文给出了细胞（ｄ１，ｄ２）－有向图自动机类的定义及其接受的语言（判断）类的定义，并讨论了该语言（判断）类在并、交。
This paper defines the class of cellular (d 1,d 2) -digraph automata and the class of the languages (predicates) accepted by it and discusses the closure of the language (predicate) class under set theoretic operations, including union, intersection and complement etc.
出处
《青岛大学学报（自然科学版）》
CAS
1996年第3期11-13,共3页
Journal of Qingdao University(Natural Science Edition)
关键词
有向图接受器
有向图行动机
有向图语言类
cellular ( d 1,d 2)- digraph acceptor
initial configuration
terminal configuration
cellular (d 1,d 2)- digraph automata class
cellular (d 1,d 2)- digraph language class
