Skip to main content
Log in

Bound problems in predicate networks and networks of weakly initial automata

  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  2. B. D. Luk’yanov, “Deterministic realizations of nondeterministic automata,” Kibern. Syst. Anal., No. 4, 34–50 (1996).

  3. B. A. Trakhtenbrot and Ya. M. Barzdin’, Finite Automata: Behavior and Synthesis [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  4. A. I. Mal’tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).

    MATH  Google Scholar 

  5. General algebra [in Russian], Vol. 1, Nauka, Moscow (1990).

  6. V. N. Vagin, Deduction and Generalization in Decision-Making Systems [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  7. Logical Approach to Artificial Intelligence. From Classical Logic to Logic Programming [Russian translation], Mir, Moscow (1990).

  8. B. D. Luk’yanov, “Distinguishing and control experiments with nondeterministic automata,” Kibern. Syst. Anal., No. 5, 69–75 (1995).

Download references

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 43–58, March–April, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luk’yanov, B.D. Bound problems in predicate networks and networks of weakly initial automata. Cybern Syst Anal 35, 208–220 (1999). https://doi.org/10.1007/BF02733469

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02733469

Keywords

Navigation