![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
A new family of automata, called orderless contraction automata of complexity (0, ∞), is introduced, and it is proved that this family of automata accepts precisely the class of propagating, normal, limited, extended, tabled 0-Lindenmayer languages (Rosenberg [4], Herman [2]). Furthermore a subfamily of this new family of automata accepts precisely the class of propagating, normal, limited, extended 0-Lindenmayer languages.