|
Showing 1 - 7 of
7 matches in All Departments
his book constitutes the refereed proceedings of the 18th
International Conference on Descriptional Complexity of Formal
Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The
13 full papers presented together with 4 invited talks were
carefully reviewed and selected from 21 submissions.Descriptional
Complexity is a field in Computer Science that deals with the size
of all kind of objects that occur in computational models, such as
Turing Machines, finte automata, grammars, splicing systems and
others. The topics of this conference are related to all aspects of
descriptional complexity.
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.
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.
This volume brings together the work of several prominent
researchers who have collaborated with Janusz Brzozowski, or worked
in topics he developed, in the areas of regular languages,
syntactic semigroups of formal languages, the dot-depth hierarchy,
and formal modeling of circuit testing and software specification
using automata theory.
Despite their classical nature, continued fractions are a
neverending research area, with a body of results accessible enough
to suit a wide audience, from researchers to students and even
amateur enthusiasts. Neverending Fractions brings these results
together, offering fresh perspectives on a mature subject.
Beginning with a standard introduction to continued fractions, the
book covers a diverse range of topics, from elementary and metric
properties, to quadratic irrationals, to more exotic topics such as
folded continued fractions and Somos sequences. Along the way, the
authors reveal some amazing applications of the theory to seemingly
unrelated problems in number theory. Previously scattered
throughout the literature, these applications are brought together
in this volume for the first time. A wide variety of exercises
guide readers through the material, which will be especially
helpful to readers using the book for self-study, and the authors
also provide many pointers to the literature.
Intended for graduate students and advanced undergraduates in
computer science, A Second Course in Formal Languages and Automata
Theory treats topics in the theory of computation not usually
covered in a first course. After a review of basic concepts, the
book covers combinatorics on words, regular languages, context-free
languages, parsing and recognition, Turing machines, and other
language classes. Many topics often absent from other textbooks,
such as repetitions in words, state complexity, the interchange
lemma, 2DPDAs, and the incompressibility method, are covered here.
The author places particular emphasis on the resources needed to
represent certain languages. The book also includes a diverse
collection of more than 200 exercises, suggestions for term
projects, and research problems that remain open.
Combining concepts of mathematics and computer science, this book is about the sequences of symbols that can be generated by simple models of computation called "finite automata". Suitable for graduate students or advanced undergraduates, it starts from elementary principles and develops the basic theory. The study then progresses to show how these ideas can be applied to solve problems in number theory and physics.
|
|