Abstract
A partial word is a word which contains some holes known as do not know symbols and such places can be replaced by any letter from the underlying alphabet. We study the relation between language of primitive partial words with the conventional language classes viz. regular, linear and deterministic context-free in Chomsky hierarchy. We give proofs to show that the language of primitive partial words over an alphabet having at least two letters is not regular, not linear and not deterministic context free language. Also we give a 2DPDA automaton that recognizes the language of primitive partial words.
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.
