REPRESENTATION OF SPACE-PLANNING DECISIONS OF BUILDINGS OF THE STATE MACHINES IN THE PARADIGM OF ARTIFICIAL INTELLIGENCE

In the article actual problems of designing space-planning decisions of buildings using set theory, graph theory, and theory of finite automata. The technique of designing space planning solutions by building a finite state machine in the form of network models for different types of buildings. Designed according to the above method models finite state machines can perform a variety of functions of a consultant architect in the form of artificial intelligence or expert systems in the development of multiple design solutions.

1. Pohorski G.V. Informacionnye tehnologii v arhitekture i stroitel'stve : uchebnoe posobie [Information technologies in architecture and construction. Textbook. 2nd ed. Erased]. Moscow, 2012, 264 p.
2. Zmeul S.G., Makhanko B.A. Arhitekturnaja tipologija zdanij i sooruzhenij: uchebnik [Architectural typology of buildings and structures. Tutorial]. Moscow, 2004.
3. Linenko E.V. Arhitekturnye konstrukcii i osnovy konstruirovanija [Architectural design and design principles [Electronic resource], "Orenburg state University", Russia Architecture]. Orenburg, Orenburg state University, 2011, 29 p.
4. Serebryakov V.A., Galochkin M.P., Potter D.R., Furugen M.G. Teorija i realizacija jazykov programmirovanija [Theory and implementation of programming languages]. Moscow, 2006, 2nd ed. ISBN 5-94073-094-9.
5. Karpov Yu.G. Teorija avtomatov: Uchebnik dlja vuzov [Theory of machines: Textbook for universities]. St. Petersburg, 2002, 224 p.
6. Melikhov A.N. Orientirovannye grafy i konechnye avtomaty [Directed graphs and finite state machines]. Moscow, 1971, 416 p.
7. Kogan D.I., Babkina T.S. Uchebno-metodicheskaja razrabotka dlja samostojatel'noj raboty studentov po kursu «Teorija algoritmov i matematicheskaja logika» pri izuchenii temy «Koncepcii konechnogo avtomata i reguljarnogo jazyka. Operacii nad reguljarnymi jazykami» [The Educational-methodical development for independent work of students in the course "Theory of algorithms and mathematical logic" under the topic "concepts of finite automata and regular language. Operations on regular languages"]. Nizhny Novgorod, 2000.