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 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.

Mathematical logic --- Logic --- Complex analysis --- Discrete mathematics --- Mathematics --- Computer science --- Computer. Automation --- discrete wiskunde --- complexe analyse (wiskunde) --- computers --- informatica --- externe fixatie (geneeskunde --- programmeren (informatica) --- wiskunde --- algoritmen --- logica

Choose an application

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

Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory.

Combinatorial analysis --- Data processing.

Choose an application

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

Number theory --- Algorithms. --- Data processing.

Choose an application

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

Number theory --- Algorithms --- Data processing