References
Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).
B. D. Luk’yanov, “Deterministic realizations of nondeterministic automata,” Kibern. Syst. Anal., No. 4, 34–50 (1996).
B. A. Trakhtenbrot and Ya. M. Barzdin’, Finite Automata: Behavior and Synthesis [in Russian], Nauka, Moscow (1970).
A. I. Mal’tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).
General algebra [in Russian], Vol. 1, Nauka, Moscow (1990).
V. N. Vagin, Deduction and Generalization in Decision-Making Systems [in Russian], Nauka, Moscow (1988).
Logical Approach to Artificial Intelligence. From Classical Logic to Logic Programming [Russian translation], Mir, Moscow (1990).
B. D. Luk’yanov, “Distinguishing and control experiments with nondeterministic automata,” Kibern. Syst. Anal., No. 5, 69–75 (1995).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 43–58, March–April, 1999.
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02733469