Testbank for Automata, Computability and Complexity: Theory and Applications, 1st Edition (2008) by Elaine Rich - Complete Solutions Manual

Automata, Computability and Complexity (1st
Edition, 2008) – Solutions Manual – Rich

Is every subset of a regular language regular? - answers-False



Is the set of binary numerals for prime numbers in P-time? - answers-True



Is every language countable? - answers-True



Is the set of languages over the binary alphabet countable? - answers-False



Is P equal to NP? - answers-Open



Is the complement of any P-time language P-time? - answers-True



Is the complement of any NP language NP? - answers-Open



Is the complement of any decidable language decidable? - answers-True



If L is both NP and co-NP, must L be P-time? - answers-Open



If L is both RE and co-RE, must L be decidable? - answers-True




1

, Is every context-free language P-time? - answers-True



Is the halting problem RE? - answers-True



Is the CFG equivalence problem RE? - answers-False



Does the language accepted by a DFA M contain the empty string if and only if the start symbol
of M is final? - answers-True



Is every subset of a regular language regular? - answers-False



Is the complement of a regular language always a regular language? - answers-True



Is the class of regular languages closed under union? - answers-True



Is the Kleene closure of any context-free language (CFL) a CFL? - answers-True



Is the class of regular languages closed under intersection? - answers-True



Is the class of context-free languages closed under union? - answers-True



Is the class of context-free languages closed under intersection? - answers-False



Is {a^n b^n : n ≥ 0} regular? - answers-False




2