الصفحة 1
الصفحة 1
Fundamentals of computation theory ; 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings
This book constitutes the refereed proceedings of the 16th International Symposium Fundamentals of Computation Theory. The papers address all current topics in computation theory.
Fundamentals of computation theory ; 15th International symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings
This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2005, held in L]beck, Germany in August 2005. The 46 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 105 submissions. The papers are organized in topical sections on circuits, automata, complexity, approximability, computational and structural complexity, graphs and complexity, computational game theory, visual cryptography and computational geometry, query complexity, distributed systems, automata and formal languages, semantics, approximation algorithms, average case complexity, algorithms, graph algorithms, and pattern matching.
Computer science : Theory and applications ; 15th International computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
An Introduction to Formal Languages and Automata
Designed for an introductory course on formal languages, automata, compatibility, and related matters forming what is known as the theory of computation
