Abstract
A OL system is called a quasi-deterministic OL system or a D'OL system for short if there is an integer C such that the cardinality of the set of words generated in n steps is less than C for every n . D'OL systems form a subfamily of the family of OL systems. It is shown that a OL system is effectively decidable whether it is a D'OL system or not and the derivations of a D'OL system are represented by the derivations of an HFDOL system. Using these results, the family of languages generated by D'OL systems is characterized in the families of HDOL languages, HFDOL languages, EFDOL languages, NDOL languages, DOL languages, and OL languages. It is also shown that the equivalence problem between context-free languages and the family of D'OL languages and the regularity and the context-freeness problems for the family of D'OL languages are decidable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
