Skip to main content
Log in

Analytical identification of discrete objects

  • Data Analysis
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration was given to the problem of identification of discrete objects which was reduced to analytical identification of the tabular functions. By the analytical identification is meant representation of the function of many variables defined on finite range spaces by a general bracket formula on the basis of arbitrary binary operations. Described was a formula generation procedure based on calculation of binary operations, order of occurrence of variables, and places of bracket arrangement. Estimates of formula complexities were presented.

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.

Similar content being viewed by others

References

  1. Myshkis, A.D., Elementy teorii matematicheskikh modelei (Elements of the Theory of Mathematical Models), Moscow: Komkniga, 2007.

    Google Scholar 

  2. Samarskii, A.A. and Mikhailov, A.P., Matematicheskoe modelirovanie. Idei. Metody. Primery (Mathematical Modeling. Ideas. Methods. Examples), Moscow: Fizmatlit, 2001.

    MATH  Google Scholar 

  3. Karabutov, N.N., Strukturnaya identifikatsiya sistem: analiz informatsionnykh struktur (Structural System Identification: Analysis of the Information Structures), Moscow: MGIU, 2008.

    Google Scholar 

  4. Perel’man, I.I., Methodology of Selecting the Model Structure for Plant Identification, Autom. Remote Control, 1983 vol. 44, no. 11, part 1, pp. 1389–1407.

    MATH  MathSciNet  Google Scholar 

  5. Spravochnik po teorii avtomaticheskogo upravleniya (Handbook of the Theory of Automatic Control), Krasovskii, A.A., Ed., Moscow: Nauka, 1987.

    Google Scholar 

  6. Graupe, D., Identification of Systems, New York: Van Nostrand, 1972. Translated under the title Metody identifikatsii sistem, Moscow: Mir, 1979.

    MATH  Google Scholar 

  7. Vapnik, V.N., Vosstanovlenie zavisimostei po empiricheskim dannym (Restoration of Dependencies from Empirical Data), Moscow: Nauka, 1979.

    Google Scholar 

  8. Zagoruiko, N.G., Prikladnye metody analiza dannykh i znanii (Applied Methods of Analysis of Data and Knowledge), Novosibirsk: Inst. Mat., 1999.

    Google Scholar 

  9. Katkovnik, V.Ya., Neparametricheskaya identifikatsiya i sglazhivanie dannykh. Metod lokal’noi approksimatsii (Nonparametric Identification and Data Smoothing. Method of Local Approximation), Moscow: Nauka, 1985.

    Google Scholar 

  10. Kurzhanskii, A.B., The Identification Problem—Theory of Guaranteed Estimates, Autom. Remote Control, 1991 vol. 52, no. 4, part 1, pp. 447–465.

    MathSciNet  Google Scholar 

  11. Ikonen, E. and Najim, K., Advanced Process Identification and Control, New York: Marcel Dekker, 2002.

    Google Scholar 

  12. Sage, A.P. and Melsa, J.L., System Identification, New York: Academic, 1971. Translated under the title Identifikatsiya sistem upravleniya, Moscow: Nauka, 1974.

    MATH  Google Scholar 

  13. Heuberger, P., Van den Hof, P., and Wahlberg, B., Modelling and Identification with Rational Orthogonal Basis Functions, London: Springer, 2005.

    Book  Google Scholar 

  14. Greblicky, W. and Pawlak, M., Nonparametric System Identification, Cambridge: Cambridge Univ. Press, 2008.

    Book  Google Scholar 

  15. Rastrigin, L.A. and Madzharov, N.E., Vvedenie v identifikatsiyu ob”ektov upravleniya (Introduction to Identification of the Control Plants), Moscow: Energiya, 1977.

    Google Scholar 

  16. Furasov, V.D., Zadachi garantirovannoi identifikatsii (Problems of Guaranteed Identification), Moscow: BINOM, Lab. Znanii, 2005.

    Google Scholar 

  17. Cassandras, C.G. and Lafortune, S., Introduction to Discrete Event Systems, New York: Springer, 2008.

    Book  MATH  Google Scholar 

  18. Masami Hagiya, Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing, in Proc. 7 Int. Conf. “Unconventional Computation” (UC 2008), Vienna, 2008, pp. 117–129.

  19. Kuzovkov, N.T., Karabanov, S.V., and Salychev, O.S., Nepreryvnye i diskretnye sistemy upravleniya i metody identifikatsii (Continuous and Discrete Control Systems and Identification Methods), Moscow: Mashinostroenie, 1978.

    MATH  Google Scholar 

  20. Garnier, H. and Wang, L., Identification of Continuous-time Models from Sampled Data, London: Springer, 2008.

    Book  Google Scholar 

  21. Yablonskii, S.V., Vvedenie v diskretnuyu matematiku (Introduction to Discrete Mathematics), Moscow: Nauka, 1986.

    Google Scholar 

  22. Bibilo, P.N., Decomposition of Boolean Functions (Review), in Proektirovanie ustroistv logicheskogo upravleniya (Design of Logic Control Devices), Moscow: Nauka, 1985, pp. 106–126.

    Google Scholar 

  23. Yablonskii, S.V., Functional Constructions in the k-valued Logic, Tr. Mat. Inst. 1958 vol. 51, pp. 5–142.

    Google Scholar 

  24. Yablonskii, S.V., On Algorithmic Difficulties of Designing the Minimal Contact Circuits, Probl. Kibern., Moscow: Fizmatgiz, 1959, no. 2, pp. 75–122.

    Google Scholar 

  25. Vykhovanets, V.S., Spectral Methods in Logical Data Analysis, Autom. Remote Control, 2001 vol. 62, no. 10, pp. 1565–1587.

    Article  MATH  MathSciNet  Google Scholar 

  26. Vykhovanets, V.S., Polunomial Factorization of Spectral Bases, Autom. Remote Control, 2004 vol. 65, no. 12, pp. 1861–1871.

    Article  MATH  MathSciNet  Google Scholar 

  27. Kuratowski, K. and Mostowski, A., Set Theory, Amsterdam: North-Holland, 1967. Translated under the title Teoriya mnozhestv, Moscow: Mir, 1970.

    Google Scholar 

  28. Belousov, A.I. and Tkachev, S.B., Diskretnaya matematika (Discrete Mathematics), Moscow: MGTU, 2004.

    Google Scholar 

  29. Vykhovanets, V.S., Algebraic Decomposition of Discrete Functions, Autom. Remote Control, 2006, vol. 67, no. 3, pp. 361–392.

    Article  MATH  MathSciNet  Google Scholar 

  30. Pentus, A.E. and Pentus, M.R., Teoriya formal’nykh yazykov (Theory of Formal Languages), Moscow: Mosk. Gos. Univ., 2004.

    Google Scholar 

  31. Reyward-Smith, V.J., A First Course in Formal Language Theory, London: Blackwell, 1983. Translated under the title Teoriya formal’nykh yazykov. Vvodnyi kurs, Moscow: Radio i Svyaz’, 1988.

    Google Scholar 

  32. Trakhtenbrot, B.A. and Bardzin’, Ya.M., Konechnye avtomaty (povedenie i sintez) (Finite Automata (Behavior and Design)), Moscow: Nauka, 1970.

    Google Scholar 

  33. Selecta Mathematica II, Jacobs, K., Ed., New York: Springer, 1970. Translated under the title Mashiny T’yuringa i rekursivnye funktsii, Ebbinghauz, G.-D., Yakobs, K., Man, F.-K., and Hermes, H., Eds., Moscow: Mir, 1972.

    MATH  Google Scholar 

  34. Handbook of Mathematical Logic, Barwise, J., Ed., Amsterdam: Horth-Holland, 1977. Translated under the title Vvedenie v logiku pervogo poryadka. Spravochnaya kniga po matematicheskoi logike, Moscow: Nauka, 1982.

    Google Scholar 

  35. Edel’man, S.L., Matematicheskaya logika (Mathematical Logic), Moscow: Nauka, 1975.

    Google Scholar 

  36. Even, S., Kohavi, I., and Paz, A., On Minimal Modulo 2 Sums of Products for Switching Functions, IEEE Trans. Elect. Comput., 1967, pp. 671–674.

  37. Kirichenko, K.D., Upper Estimate of Complexity of the Polynomial Normal Forms of Boolean Functions, Diskret. Mat., 2005 vol. 17, no. 3, pp. 80–88.

    Google Scholar 

  38. Lupanov, O.B., On Designing Some Classes of the Control Systems, Probl. Kibern., 1963, no. 10, pp. 63–97.

  39. Moore, E.E., Sequential Machines, Reading: Addison-Wesley, 1964. Translated under the title Umozritel’nyi experiment s posledovatel’nostnymi mashinami. Avtomaty, Moscow: Inostrannaya Literatura, 1966.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © V.S. Vykhovanets, 2011, published in Avtomatika i Telemekhanika, 2011, No. 7, pp. 159–189.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vykhovanets, V.S. Analytical identification of discrete objects. Autom Remote Control 72, 1497–1526 (2011). https://doi.org/10.1134/S0005117911070174

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117911070174

Keywords

Navigation