Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully reviewed and selected from 26 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, finite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.

Computer science. --- Software engineering. --- Computers. --- Algorithms. --- Computer logic. --- Mathematical logic. --- Computer Science. --- Logics and Meanings of Programs. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Algorithm Analysis and Problem Complexity. --- Software Engineering/Programming and Operating Systems. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Computer science logic --- Algorism --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer software engineering --- Informatics --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Logic, Symbolic and mathematical --- Algebra --- Arithmetic --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Engineering --- Science --- Foundations --- Logic design. --- Computer software. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Software, Computer --- Machine theory. --- Computer Science Logic and Foundations of Programming. --- Theory of Computation. --- Formal Languages and Automata Theory. --- Software Engineering. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.

Computer logic. --- Artificial intelligence. --- Mathematical logic. --- Database management. --- Logics and Meanings of Programs. --- Artificial Intelligence. --- Mathematical Logic and Formal Languages. --- Database Management. --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Electronic data processing --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Computer science logic --- Logic, Symbolic and mathematical --- Formal methods (Computer science) --- Formal languages --- Computer science. --- Machine theory. --- Computer Science Logic and Foundations of Programming. --- Formal Languages and Automata Theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics --- Informatics --- Science

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical logic --- Logic --- Information systems --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- computers --- database management --- wiskunde --- KI (kunstmatige intelligentie)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).

Computer Science. --- Algorithm Analysis and Problem Complexity. --- Computer science. --- Computer software. --- Informatique --- Logiciels --- Computer Science --- Engineering & Applied Sciences --- Algorithms. --- Algorism --- Algebra --- Arithmetic --- Informatics --- Science --- Foundations --- Computational complexity. --- Electronic data processing. --- Data structures (Computer scienc. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Data Structures. --- Mathematical Logic and Formal Languages. --- Math Applications in Computer Science. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Electronic data processing --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Data structures (Computer science) --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Computer science --- Mathematics --- Computer science—Mathematics. --- Numerical analysis. --- Data structures (Computer science). --- Mathematical logic. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Mathematical analysis --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Machine theory. --- Numerical Analysis. --- Data Science. --- Formal Languages and Automata Theory. --- Mathematical Applications in Computer Science. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) objects; state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov complexity.

Engineering & Applied Sciences --- Computer Science --- Formal languages --- Machine theory --- Computer science. --- Software engineering. --- Computers. --- Computer logic. --- Mathematical logic. --- Computer Science. --- Computation by Abstract Devices. --- Software Engineering. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Computer software engineering --- Engineering --- Informatics --- Science --- Logic design. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Machine theory. --- Theory of Computation. --- Formal Languages and Automata Theory. --- Computer Science Logic and Foundations of Programming. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics