Abstract
A new variation of 0L systems, called quasi-deterministic 0L systems, is defined. A quasi-deterministic 0L system is a 0L system which generates a bounded set of words at every step, where “bounded” means that the cardinality of the set is always less than a given constant. The family of languages generated by quasi-deterministic 0L systems is properly included by the family of 0L languages and properly includes that of D0L languages. A 0L system is effectively determined whether it is quasi-deterministic or not.
Cite
CITATION STYLE
Nishida, T. Y. (1992). Quasi-deterministic 0L systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 65–76). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
