Abstract
The aim of Section 2.1 is to define some standard basic notions from formal language theory and Boolean function theory used in this book. The reader is advised that this section does not give a detailed exposition (including illustrative examples of objects defined or some theorems and proofs about the defined objects) of the topics covered, but rather a setting of the notations and concepts which will be freely used throughout the book. Formal definitions are given for all notions which will be formally handled in the next chapters. Formal definitions of the fundamental notions (for instance, for finite automata or context-free grammars here) are not included, because their formal descriptions are not needed to prove any results presented in this book. Nevertheless we shall use these notions to discuss the consequences of the presented results for other theories or applications, and sometimes to formulate statements. In these cases, we assume that the reader is familiar with the fundamentals of formal language theory, Boolean function theory, graph theory and combinatorics.
Published Version
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