Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Category Archives: Appendix- Automata and Language Theory

Protected: Tree Transducer Language Membership

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged 3SAT, AL21, Difficulty 8, Tree Transducer Language Membership on July 22, 2021 by Sean T. McCulloch.

Protected: Context-Sensitive Language Membership

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged AL20, Context-Sensitive Language Membership, Difficulty 4, Linear Bounded Automaton Acceptance, uncited reduction on May 26, 2021 by Sean T. McCulloch.

Protected: ETOL Language Membership

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged 3SAT, AL19, Difficulty 6, ETOL Language Membership on May 12, 2021 by Sean T. McCulloch.

Protected: Context-Free Programmed Language Membership

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged 3-sat, AL17, Context-Free Programmed Language Membership, Difficulty 7 on April 28, 2021 by Sean T. McCulloch.

Protected: ETOL Grammar Non-Emptiness

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged Al16, Difficulty 8, ETOL Grammar Non-Emptiness, Regular Expression Inequivalence on Single Character Alphabets on April 14, 2021 by Sean T. McCulloch.

Protected: Non-LR(K) Context-Free Grammar

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged Difficulty 9, Generic Reduction, Non-LR(k) Context-Free Grammar on March 31, 2021 by Sean T. McCulloch.

Protected: Regular Grammar Inequivalence

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged Al14, Regular Expression Inequivalence, Regular Grammar Inequivalence on March 17, 2021 by Sean T. McCulloch.

Protected: Structural Inequivalence for Linear Grammars

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged AL13, Difficulty 6, Regular Expression Inequivalence, Regular Expression Inequivalence on Single Character Alphabets, Structural Inequivalence for Linear Grammars on March 3, 2021 by Sean T. McCulloch.

Protected: Reynolds Covering for Context-Free Grammars

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged AL11, Clique, Difficulty 7, Reynolds Covering for Context-Free Grammars on January 21, 2021 by Sean T. McCulloch.

Protected: Reduction of Incompletely Specified Automata

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Automata and Language Theory and tagged AL7, Difficulty 8, Graph K-Coloring, Reduction of Incompletely Specified Automata on December 24, 2020 by Sean T. McCulloch.

← Older posts

Search for: