Abstract
Recently, we introduced a new automata model, so-called colored finite automata (CFAs) whose accepting states are multi-colored (i.e., not conventional black-and-white acceptance) in order to classify their input strings into two or more languages, and solved the specific complexity problems concerning color-unmixedness of nondeterministic CFA. More precisely, so-called UV, UP, and UE problems were shown to be NLOG-complete, P, and NP-complete, respectively. In this paper, we apply the concept of colored accepting mechanism to pushdown automata and show that the corresponding versions of the above mentioned complexity problems are all undecidable.
Sign-in/Register to access full text options 
Free) 
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 call
