Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Cybern Syst Anal

Search In Journal Title:

Abbravation: Cybernetics and Systems Analysis

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0167-2789(94)90104-x

Search In DOI:

ISSN

1573-8337

Search In ISSN:
Search In Title Of Papers:

On the complexity of analysis of automata over a f

Authors: V V Skobelev V G Skobelev
Publish Date: 2010/08/03
Volume: 46, Issue: 4, Pages: 533-545
PDF Link

Abstract

A general scheme is investigated that is destined for obtaining estimates based on the cardinality of subsets of a fixed set of automata over some finite commutativeassociative ring with unit element A scheme is proposed to solve parametric systems of polynomial equations based on classes of associated elements of the ring Some general characteristics of automata over the ring are established

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Developing feasible and optimal schedules of jobs on one machine
  2. A model of optimal control over a nonlinear multidimensional innovation diffusion process
  3. Stability radius of a vector integer linear programming problem: case of a regular norm in the space of criteria
  4. Comparing the estimates of ROC curves by modeling methods
  5. Data based algorithmic algebra
  6. Randomized projective methods for the construction of binary sparse vector representations
  7. Synthesis of Adaptive Logical Networks on the Basis of Zhegalkin Polynomials
  8. Equilibrium Processes in Biomedical Data Analysis: The Wright–Fisher Model
  9. Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives
  10. An approach problem for a discrete system with random perturbations
  11. Formalizing the consistency of experts’ judgments in the Delphi method
  12. Combinatorial optimization under uncertainty
Search Result: