About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 279. Chapters: Formal languages, Formal sciences, Mathematics, Context-free grammar, Chomsky hierarchy, Game theory, Regular expression, Regular language, Artificial intelligence, Data compression, Information theory, David Hilbert, Pumping lemma, Backus-Naur Form, Regular grammar, Context-sensitive grammar, Chomsky normal form, Recursively enumerable language, Queueing theory, Kleene star, Context-sensitive language, String, Operations research, Data mining, Bioinformatics, Markup language, Extended Backus-Naur Form, Econometrics, Abstract syntax tree, L-system, Computational linguistics, Greibach normal form, Control theory, Context-free language, Star height problem, Pattern recognition, Augmented Backus-Naur Form, Kleene algebra, Diff, Statistical physics, Concatenation, Formal methods, Metacharacter, Complex systems, Time series, Decision theory, Cryptography, Logic, Junction Grammar, Controlled grammar, Actuarial science, Cybernetics, Interpretation, Antimatroid, Parsing expression grammar, Rewriting, Categorial grammar, Praxeology, Formal grammar, Adaptive grammar, Nested word, Parameterized post-Newtonian formalism, Well-formed formula, Abstract rewriting system, Recursive languages and sets, Syntactic predicate, Semi-Thue system, Finite state transducer, Definite clause grammar, Systems science, Systems ecology, Pumping lemma for regular languages, Longest increasing subsequence, Parser combinator, Left recursion, Stochastic context-free grammar, Theoretical computer science, ADM formalism, SCIgen, Formal ontology, Trace monoid, Mathematical finance, Indexed grammar, Semiautomaton, Compiler Description Language, Formal system, Semantics encoding, Proof, Van Wijngaarden grammar, History monoid, Terminal and nonterminal symbols, Abstract family of acceptors, String operations, Free monoid, Descriptional Complexity of Forma...