Automata in SageMath - Combinatorics meet Theoretical Computer Science
نویسندگان
چکیده
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved using SageMath. In particular, we compute the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was not known before.
منابع مشابه
Automata in SageMath — Combinatorics meets Theoretical Computer Science
You might ask now: Why?—Why exactly this?—A small hint: It has to do with multiplication as the title of the first act says. Already guessed?—Yes?—No?—Then, here is the answer. Suppose that we want to multiply a huge number n by 9999. Suddenly today’s guest list becomes clearer. Such a multiplication should not be done according to the schoolbook, but just by subtracting n from 10000n. Since no...
متن کاملAround probabilistic cellular automata
We survey probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint. Some of the questions studied are specific to a domain, and some others are shared, most notably the ergodicity problem.
متن کاملCombinatorics on Words
Words (strings of symbols) are fundamental in computer processing. Indeed, each bit of data processed by a computer is a string, and nearly all computer software use algorithms on strings. There are also abundant supply of applications of these algorithms in other areas such as data compression, DNA sequence analysis, computer graphics, cryptography, and so on. Combinatorics on words belongs to...
متن کاملFuzzy h-ideals of a Γ-hemiring and its operator hemirings
Hemirings [3] which provide a common generalization of rings and distributive lattices arise naturally in such diverse areas of mathematics as combinatorics, functional analysis, graph theory, automata theory, mathematical modelling and parallel computation systems etc.(for example, see [3], [4]). Hemirings have also been proved to be an important algebraic tool in theoretical computer science,...
متن کاملQuantum Finite Automata and Weighted Automata
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 18 شماره
صفحات -
تاریخ انتشار 2016