Titlebook: Structural Theory of Automata, Semigroups, and Universal Algebra; Proceedings of the N Valery B. Kudryavtsev,Ivo G. Rosenberg,Martin Gold C

无缘无故

书目名称Structural Theory of Automata, Semigroups, and Universal Algebra影响因子(影响力)




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra影响因子(影响力)学科排名




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra网络公开度




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra网络公开度学科排名




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra被引频次




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra被引频次学科排名




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra年度引用




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra年度引用学科排名




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra读者反馈




书目名称Structural Theory of Automata, Semigroups, and Universal Algebra读者反馈学科排名

SUGAR

Profinite semigroups and applications,te semigroups which in turn serve as a classifying tool for rational languages. Of particular relevance are relatively free profinite semigroups which for pseudovarieties play the role of free algebras in the theory of varieties. Combinatorial problems on rational languages translate into algebraic-

规范要多

DOSE

Completeness of automaton mappings with respect to equivalence relations,tion if the subalgebra generated by . contains at least one element of any equivalence class. The paper summarizes the results with respect to some known completeness notions, such as the classical completeness, .-completeness and Kleene-completeness which can be reformulated as completenesses with

acquisition

去世

Classification in finite model theory: counting finite algebras,st . elements. We consider the behavior of G.(.) when . is a locally finite equational class (variety) of algebras and . is finite. We are interested in ways that algebraic properties of . lead to upper or lower bounds on generative complexity. Some of our results give sharp upper and lower bounds s

载货清单

On the automata functional systems,ver the past 30 years, that is, since the appearance and during the years of formation of automata theory. The description of the properties of the automata functional systems is done for model systems in order of their increasing complexity. The first to be considered are automata without memory, i

食草

Algebra of behavior transformations and its applications,e elements of continuous behavior algebra, a kind of the ACP with approximation relation, but in addition each environment is supplied by an insertion function, which takes the behavior of an agent and the behavior of an environment as arguments and return a new behavior of this environment. Each ag

confide

Congruence modular varieties: commutator theory and its uses, present was first introduced to the mathematical world in a 1976 monograph of J. D. H. Smith, devoted to varieties with permuting congruences. It was extended to congruence modular varieties in a 1979 paper by J. Hagemann and C. Herrmann, and has since been elaborated into an impressive machinery f

讥笑