Introduction to Automata Theory, Languages, and Computation
The fundamentals of the theory of automata, formal languages, and regular, context-free grammar. Discussion of the principle of Turing, which formalize the concept of soluble and insoluble problems, the definition of time and space evaluation algorithms.
Подобные документы
Thin and sparse metric spaces as asymptotic counterparts of discrete and very close to discrete metric spaces respectively. Classify thin metric spaces up to coarse equivalence. The types of sparse spaces and construct the spaces of distinct types.
статья, добавлен 19.02.2016Multidimensional data distributions with complex topologies and variable local dimensions. A new type of low-dimensional "principal object": a principal cubic complex. The method of topological grammars with the minimization of an elastic energy.
статья, добавлен 08.02.2013One of the effective methods for solving such problems in case of piecewise-homogeneous environments is a one of hybrid integral transforms. It solves the problem of torsion of semi-bounded piecewise homogeneous elastic cylinder with various features.
статья, добавлен 25.08.2016An optimal boundary control problem associated to the linear parabolic equation. The characteristic feature of this equation, skew-symmetric. A unique solution to the original optimal boundary control problem, singular character of the original matrix.
статья, добавлен 30.10.2016Tiling of the limit space under the action of a (self-similar) subgroup. Self-similar groups and their limit spaces. Subgroup tilings of limit spaces. Tilings of limit spaces of abelian and nilpotent groups. Functional analysis to nilpotent Lie groups.
статья, добавлен 27.06.2016The results of the participants of the scientific seminar "Problems of elementary divisor rings" concerning the Bezout rings of finite stable range. The conditions under which these rings are elementary divisor rings. These rings introduced Kaplansky.
статья, добавлен 19.02.2016