Map OL-systems with edge label control: Comparison of marker and cyclic systems

In this paper we discuss binary propagating map OL-systems (BPMOL systems). There are four classes of BPMOL systems, distinguished by the edge labelling that can be single or double and by edge insertion control that can be by markers or by byclic expressions. In this paper we are only concerned with deterministic BPMOL systems. In the first section we discuss the decidability of determinism of marker controlled BPMOL systems with single edge labelling. Furthermore we show for these systems that finiteness of the circular word languages is decidable and point out some relationships between the edge productions and the size of the circular word languages. We also show that their wall and edge growth functions are DOL growth functions. In the second section we compare the generative powers of deterministic marker controlled and cyclic controlled BPMOL systems with single edge labelling. It shows that the marker controlled systems are more powerful than the cyclic controlled ones.