Choose an application

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

This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.

Computer Science. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Computer science. --- Computer software. --- Logic design. --- Computational complexity. --- Informatique --- Logiciels --- Structure logique --- Complexité de calcul (Informatique) --- Computer Science --- Engineering & Applied Sciences --- Computers. --- Algorithms. --- Computer logic. --- Mathematical logic. --- Computer science --- Mathematics. --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Informatics --- Science --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- 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 --- Algorism --- Algebra --- Arithmetic --- Foundations --- Complexity, Computational --- Software, Computer --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Formal methods (Computer science) --- Computer science—Mathematics. --- Machine theory. --- Discrete mathematics. --- Theory of Computation. --- Formal Languages and Automata Theory. --- Computer Science Logic and Foundations of Programming. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- 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 refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of 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; complexity aspects of combinatorics on words; Kolmogorov complexity.

Computer science. --- Computers. --- Algorithms. --- Computer logic. --- Mathematical logic. --- Computer science --- Computer Science. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Mathematics. --- Logic design. --- Computer software. --- Computational complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Software, Computer --- Computer systems --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Informatics --- Science --- Computer science—Mathematics. --- Algorism --- Algebra --- Arithmetic --- Computer science logic --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Cybernetics --- Calculators --- Cyberspace --- Foundations --- Formal methods (Computer science) --- Machine theory. --- Discrete mathematics. --- Theory of Computation. --- Formal Languages and Automata Theory. --- Computer Science Logic and Foundations of Programming. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- 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 refereed proceedings of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019, held in St. Petersburg, Russia, in March 2019. The 31 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 98 submissions. The papers cover the following topics: Automata; Complexity; Grammars; Languages; Graphs, trees and rewriting; and Words and codes.

Logic design. --- Computer software. --- Computer science. --- Artificial intelligence. --- Computer logic. --- Computational complexity. --- Logics and Meanings of Programs. --- Algorithm Analysis and Problem Complexity. --- Mathematical Logic and Formal Languages. --- Logic in AI. --- Discrete Mathematics in Computer Science. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer science logic --- Logic, Symbolic and mathematical --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Informatics --- Science --- Software, Computer --- Computer systems --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Formal languages --- Mathematical linguistics --- Algorithms. --- Mathematical logic. --- Computer science—Mathematics. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Algorism --- Algebra --- Arithmetic --- Foundations --- Machine theory. --- Logic programming. --- Discrete mathematics. --- Computer Science Logic and Foundations of Programming. --- Formal Languages and Automata Theory. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Computer programming --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics

Choose an application

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

Mathematical logic --- Complex analysis --- Computer science --- complexe analyse (wiskunde) --- informatica --- wiskunde --- logica