Abstract
In this chapter, we briefly recall basic definitions from theoretical computer science. We start with several general notations from formal language theory (words, finite automata, word rewriting systems). The main part of the chapter is a brief introduction into basic concepts from complexity theory. The goal is to enable readers that are not familiar with complexity theory to understand the results and proofs in this book. But this chapter cannot replace a thorough introduction into the broad field of complexity theory. For this, we refer the reader to the textbooks [7, 138].
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.
