<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Constructive-Synthesizing Modelling of Multifractals Based on Multiconstructors</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Viktor</forename><surname>Shynkarenko</surname></persName>
							<email>sinkarenko_vi@ua.fm</email>
							<affiliation key="aff0">
								<orgName type="institution">Ukrainian State University of Science and Technologies</orgName>
								<address>
									<addrLine>Lazaryana str. 2</addrLine>
									<postCode>49010</postCode>
									<settlement>Dnipro</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Robert</forename><surname>Chyhir</surname></persName>
							<email>robertchigir@ukr.net</email>
							<affiliation key="aff0">
								<orgName type="institution">Ukrainian State University of Science and Technologies</orgName>
								<address>
									<addrLine>Lazaryana str. 2</addrLine>
									<postCode>49010</postCode>
									<settlement>Dnipro</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Constructive-Synthesizing Modelling of Multifractals Based on Multiconstructors</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">15CB9398F971262E61BAB63F1E78C1D3</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T18:45+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Constructive-synthesizing modeling</term>
					<term>software</term>
					<term>constructor</term>
					<term>algorithm</term>
					<term>formal grammar</term>
					<term>formalization</term>
					<term>fractal</term>
					<term>information technology</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The concept of constructive-synthesising modelling is presented. The basic principles are determined. The classification of constructors by the purpose of constructing and external relations is presented. The types of constructors are defined: generating, transforming, analysing, optimising/adapting, algorithmic; autonomous, parametric, interactive, multiconstructors. Achievements in the application of the constructive-synthesising approach to solving a variety of problems are presented. The instrumental software "Constructor 1.1" has been developed. Simultaneously with the demonstration of the capabilities of the developed software environment, the formation of flat geometric multifractals is demonstrated. The formation of a multifractal is performed by realization a multiconstructor, which consists of a number of autonomous generating, parametric transforming and algorithmic constructors. The features of the deployment of transformations in the formation of constructors are shown: specialization, interpretation and concretization. The specialization of constructors determines the subject area of construction, necessary data and operations. To ensure the functioning of the constructive processes, all constructor operations must be interpreted by the corresponding procedures of the algorithmic constructor. The combination of the constructor (model of data and possible operations) with the algorithmic constructor (model of the executor) forms a constructive system capable of autonomous constructor by an internal executor. Substitution rules and initial conditions are setting in concretization. The developed software provides a certain flexibility in terms of possible modifications and the formation of new constructors and processes. This toolkit can be used as a basis for modelling various constructions and construction processes, especially in the tasks of their optimisation and structural adaptation.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Consider the constructive paradigm of human perception of the world and the corresponding approach to programming.</p><p>The main principles of the constructive paradigm:</p><p>• the world is perceived as a set of constructions and constructive processes;</p><p>• constructions consist of some elements and other constructions;</p><p>• constructive process consists of elementary actions (discrete or continuous, deterministic or stochastic, etc.) and other processes; • elements, constructions, intermediate forms of construction are interconnected by some relations of linkage; • elements of constructions, intermediate forms of construction, constructions, relations and operations -each has its own set of certain attributes; • the triad relation → operation → relation is used in the formation of constructions.</p><p>The last statement requires some explanation. For example, in algebra of integers with a given addition operation, the entry «3+4» is perceived as a relation: you need to add 3 and 4, and the result of the addition operation is 7. In other words, we have a relation → operation: we need «to add» and «addition».</p><p>In the constructive paradigm: we have a relation «a screw can be screwed into a certain hole» (some of their attributes must match: the size of the hole and the bolt, the threading, the threading pitch). This relationship is the basis of the operation of screwing -a screw into a hole. As a result of the operation, a new screw to hole relationship is established. The relation between the hole and the screw has changed according to the triad of related relations and operations: can be screwed → screwing operation → screwed. As a result of the operation, all arguments (elements) with the new relationship remain.</p><p>The paradigm of constructive-synthesising modelling emerged as a result of an unsuccessful attempt to generalise the known tools of formal grammars. As it has been revealed, there are a large number of grammars' modifications <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b2">2]</ref>, such as multi-character <ref type="bibr" target="#b3">[3]</ref>, programmatic, stochastic <ref type="bibr" target="#b4">[4,</ref><ref type="bibr" target="#b5">5]</ref>, weighted, index <ref type="bibr" target="#b6">[6]</ref>, matrix <ref type="bibr" target="#b7">[7]</ref>, various graphical <ref type="bibr" target="#b5">[5]</ref> and grammar-like L-systems <ref type="bibr" target="#b8">[8]</ref>, R-systems <ref type="bibr" target="#b9">[9]</ref>, etc.</p><p>The main advantages of the proposed approach: it is possible to link structures with constructive processes by using the same model; optimise or adapt the structure of the construction and processes (components, their location, connections); model constructions that are difficult or even impossible to obtain by other methods; perform construction comparisons; to model, analyse and predict constructive processes. The paper considers the functionality of the software "Constructor 1.1" developed by the authors for automating the development of constructive-synthesising models and their use</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related works</head><p>A number of studies have been conducted using constructive-synthesising modelling, which demonstrate the productivity and effectiveness of this approach. There are some of them.</p><p>New possibilities for the formation of geometric fractals have been identified <ref type="bibr" target="#b10">[10]</ref>. Namely, the formation of fractals from heterogeneous elements; combining different, including classical, fractals in multifractals. The possibilities of forming fractals have been expanded by eliminating the restrictions required by other approaches: the elements of the fractal formation must be represented by essentially non-intersecting sets; only compressive mappings are used. The new capabilities allow for new research and development in various fields such as theoretical physics or computer graphics.</p><p>The structural adaptation of algorithms and the data compression process is formalised by a set of three constructors <ref type="bibr" target="#b11">[11]</ref>: a dual constructor of the compression algorithm (compression and decompression), a converter of the constructed algorithm into a constructive compression process, and the constructor-adapter. The constructors are implemented in the appropriate software, and its functional efficiency in compressing various data banks has been established. This made it possible to significantly increase the speed and efficiency of processing large amounts of information.</p><p>The developed constructive-synthesising model of natural language <ref type="bibr" target="#b12">[12]</ref> allows: to consider language as a constructive process that can be used as a basis for creating a methodology for building systems with a high degree of intelligence; to improve the processes of semantic analysis, in particular, in the tasks of comparing and identifying the relevant semantic content in texts, thus significantly reducing the influence of synonyms, homonyms, periphrases and translation. The results of the constructor can be used to solve problems of developing intelligent systems for processing natural language texts. Modelling crystal lattices for researching existing materials and modelling new materials, studying crystallisation processes. To model crystal lattices, constructive-synthesising modelling is used <ref type="bibr" target="#b13">[13]</ref>. The constructors consider the attributes of the elemental base, which allows them to naturally build fractal spatial graphs according to the rules of substitution. Crystal lattices are viewed as special cases of fractal spatial graphs. This approach facilitates the creation of new materials with unique properties and allows for a different perspective on existing crystal shapes in the study and teaching of crystals.</p><p>The usage of constructive-synthesising modelling in the formation of lightning discharges based on the constructive-synthesising approach allows obtaining a realistic description of lightning frontal activity <ref type="bibr" target="#b14">[14]</ref>. This approach can be the basis for solving the dynamic problem of lightning protection of engineering structures and civilian facilities, as well as developing a strategy for the behaviour of aircraft to minimise the risks of lightning strikes when moving in a thunderstorm front. This helps to improve flight safety and reduce risks during thunderstorm activity based on forecasting and analysing the activity of atmospheric masses during previous periods of activity.</p><p>The use of constructive-synthesising modelling tools has made it possible to formalise the processes and results of structure design at a logical level <ref type="bibr" target="#b15">[15]</ref>. The constructor realization represents models of logically related specific data elements. A constructor model for representing and adapting data in RAM according to a logical model has also been developed.</p><p>Special software was developed to solve each of these and many other construction and modelling tasks (coding and debugging programs, hierarchy analysis, detecting borrowings in texts, determining the author's style and author of a text, fractal time series, university class schedules, and forming railway transport ontologies). The objective of this work is to simplify constructive modelling by developing a universal software. This software aims to combine various aspects of modelling and constructing, providing an integrated solution for a wide range of tasks.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Types of constructors</head><p>All constructors are formed on the basis of the generalised constructor, the theoretical foundations of which are laid down in <ref type="bibr" target="#b0">[1]</ref> (where the outdated term for a constructor was usedformal structure).</p><p>A generalised constructor (abstract) is defined as:</p><formula xml:id="formula_0">𝐶 = 𝑀, Σ, Λ ,<label>(1)</label></formula><p>where 𝑀 is renewable heterogeneous carrier, Σ is signature of relations and related operations, Λ is information support for construction: purpose, conditions for starting and completing construction, substitution rules and restrictions.... The formation of real constructors is carried out by refining transformations of the generalised: concretization, specialization, interpretation and realization. Specialization defines the scope of use, its features, construction elements with attributes, and constraints. Interpretation matches all operations with algorithms for their execution, which can be performed by some internal performers. In the concretization, the rules for substitution and operations on attributes and initial values are set. The realization forms the resulting view of the constructor in a certain specified form. At the realization stage, the internal executor forms the constructor structures or performs constructive processes according to the specified rules and restrictions.</p><p>According to the purpose of use, constructors are divided into: 1. generating, which, according to the given rules, perform the formation of construction/constructive processes (one or more) within a certain described subject area; 2. transforming, which, based on one construction (its model), form another. For example, a program in processor codes into a constructive process of its execution; 3. analysing, which analyse constructors based on certain rules using specified methods. For example, to check whether the constructor can be formed according to the existing rules;</p><p>4. optimising/adapting, which are capable of changing the construction of a constructor or the constructive process (components, their order and connections); 5. algorithmic -in combination with other constructors, they create a constructive system: a model of elements, intermediate forms and possible operations on them is combined with a model of an internal performer who can perform all operations.</p><p>Constructors are distinguished by their external connections: 6. autonomous, which have all the necessary information to achieve the goal and do not require external information; 7. parametric, which are provided with external data before starting work through the parameter mechanism; 8. interactive, which have operations of obtaining data from the outside: from external media, including cloud, from the user, from external information collection devices; 9. multiconstructors that consist of several combined constructors based on the sequence of their realization. The constituent constructors are specified in advance for further combination in a multiconstructor.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Functionality of «Constructor 1.1»</head><p>The «Constructor 1.1" software was developed using Python with the usege of Qt technology to ensure cross-platform compatibility.</p><p>Demonstrate its functionality by modelling the plane fractal "Sierpinski Triangles" with the linear fractals "Koch's Snowflake" and "Sierpinski Curve" in the middle of the triangles.</p><p>To the list of constructors (Figure <ref type="figure" target="#fig_0">1</ref>), add the constructors (Figure <ref type="figure" target="#fig_1">2</ref>) one by one. Each of them inherits all the properties of the generic constructor.  The button menu on the form of Figure <ref type="figure" target="#fig_0">1</ref> contains the following buttons from top to bottom: add new, delete, duplicate, edit, refine transformations, realize constructor, display the multiconstructor diagram, and exit the program.</p><p>Add the first constructor. When confirmed on the form of Figure <ref type="figure" target="#fig_1">2</ref>, the autonomous constructor for generating the plane fractal "Sierpinski Triangle" is added to the list of constructors according to the form of Figure <ref type="figure" target="#fig_0">1</ref>.</p><p>From the form in Figure <ref type="figure" target="#fig_0">1</ref>, we proceed to the refinement transformations of this constructor (Figure <ref type="figure" target="#fig_2">3</ref>). In specialization, we define the main elements responsible for the preservation of triangles and set the purpose of each of them (Figure <ref type="figure" target="#fig_3">4</ref>, Figure <ref type="figure" target="#fig_4">5</ref>). Without specialization, interpretation, and concretization, realization is not available (impossible), but they can be specified in any sequence and a change in one may lead to a change in the other. Specialization identifies data with their types (Figure <ref type="figure" target="#fig_3">4</ref>) and operations with a list of formal parameters (Figure <ref type="figure" target="#fig_4">5</ref>). In interpretation, we add the appropriate algorithmic constructor. Define the basic algorithms in the algorithmic constructor "Triangular", the constructor is added to the list as in Figure <ref type="figure" target="#fig_0">1</ref>. In specialization (Figure <ref type="figure" target="#fig_5">6</ref>) is to provide well-established procedures that can perform all the operations of constructing a given plane fractal. Preparation and debugging of these procedures is performed separately from this program in the Python environment.  This constructor is combined with a autonomous constructor and can be used not only in one constructor, since it performs the function of grouping algorithmic processes by a specific subject area. Changing the algorithmic constructor will lead to changes in all constructors where it is used.</p><p>After adding the algorithmic constructor "Creating triangles", return to the interpretation of the autonomous constructor "Sierpinski's triangle". On the form (Figure <ref type="figure" target="#fig_6">7</ref>), we define the appropriate algorithmic constructor, add and match the operations in the specification of the "Sierpinski Triangle" constructor (Figure <ref type="figure" target="#fig_2">3</ref>) with the algorithms of the "Triangular" algorithmic constructor (Figure <ref type="figure" target="#fig_5">6</ref>) that can perform them. Algorithms that implement the operations of substitution, partial and full output are required <ref type="bibr" target="#b0">[1]</ref>. As a result of the interpretation, a constructive system is formed that combines a constructor with elements and possible operations and a model of an internal performer capable of performing these operations.</p><p>The concretization sets the rules of substitution (construction) on the form shown in Figure <ref type="figure" target="#fig_7">8</ref>, which consist of substitution relations and operations on attributes and initial conditions of formation (initial data values that were defined in the specialisation) on the form of Figure <ref type="figure" target="#fig_8">9</ref>. The values are set according to the types of attributes. In this case, we set the initial number of triangles and their location on the coordinate plane in the corresponding attributes.   Since the constructor of the formation of a plane fractal is autonomous, after all the refinement transformations, it becomes possible to realize it, that is, to form a set of triangles that reflect the plane fractal "Sierpinski Triangle". The coordinate values of the shapes on the coordinate plane and their attributes will be saved to a specified file for further use. The formation of the data set is performed on the basis of the established rules and the specified algorithms in the constructors.</p><p>Next, each of the triangles in the resulting set is assigned a specific fractal shape such as a Koch snowflake or a Sierpinski curve. These fractals are formed on the basis of the corresponding reference values of L-systems.</p><p>Create parametric constructors for forming multi-character sequences for such fractals. First, create a parametric multi-character constructor for the Koch snowflake.</p><p>In specialization, we will define the subject area of the constructors as the formation of fractals of this type and set the main attributes that are relevant for the formation of sequences based on the input data set of the parametric constructor (Figure <ref type="figure" target="#fig_9">10</ref>). For interpretation, we will add an algorithmic constructor with defined algorithms for generating multi-character sequences based on the rules of L-systems (Figure <ref type="figure" target="#fig_10">11</ref>). Link this algorithmic constructor to the parametric constructor "Koch's Snowflake L-system" to this parametric constructor (Figure <ref type="figure" target="#fig_11">12</ref>). In concretization, define the initial data values (Figure <ref type="figure" target="#fig_12">13</ref>) as the initial symbolic sequence and the substitution rules (Figure <ref type="figure" target="#fig_13">14</ref>) for a particular fractal "Koch's Snowflake" (Figure <ref type="figure" target="#fig_12">13</ref>).  In realization, this constructor will create multi-character sequences in each of the triangles that will be passed to it as parameters.</p><p>Similarly to the development of the "Koch's Snowflake L-system" constructor (Figures <ref type="figure" target="#fig_13">10-14</ref>), we develop a constructor for the formation of the symbolic sequence "Sierpinski's Curve L-system".</p><p>In the same way as shown in Figure <ref type="figure" target="#fig_9">10</ref> -14, we create parametric constructors for calculating coordinates for fractals based on the multi-character sequences "Koch's Snowflake Point" and "Sierpinski's Curve Point".</p><p>To graphically display the shapes formed as a result of realizations of the "Sierpinski Triangle", "Koch's Snowflake Point" and "Sierpinski Curve Point" constructors, we create a parametric graphical constructor to display the "Sierpinski Triangle" multifractal containing black triangles with the "Koch's Snowflake Point" fractal and white triangles with the "Sierpinski Curve Point" fractal, similarly to the previous constructors.</p><p>After defining all the autonomous and parametric constructors with the corresponding algorithmic constructors, we will combine them into one sequential process of forming a structure in the multiconstructor. Let's add the multi-constructor "Sierpinski Graphic Triangle" to the list of constructors.</p><p>At the stage of specialisation, we will determine the sequence of actions for creating constructors, forming structures and transferring data between constructors (Figure <ref type="figure" target="#fig_14">15</ref>). In realization the multi-constructor, we will get a file with the image of the "Sierpinski Triangle" multifractal with the linear fractals "Koch's Snowflake" and "Sierpinski Curve" in triangles (Figure <ref type="figure" target="#fig_5">16</ref>) at three iterations. The image corresponds to the appearance of the reference corresponding fractals.</p><p>Sierpinski Triangle multifractal with Koch snowballs and Sierpinski curves. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusions</head><p>The constructive-synthesising approach has been used repeatedly to confirm its relevance and to test it on the example of phenomena and processes from the world around us.</p><p>By developing constructors for other subject areas, it is possible to obtain constructions and constructive processes of a different nature. Each constructor is an independent and separate block in the formation of constructions.</p><p>The developed software can be the basis for modelling various constructions and constructive processes, especially in the tasks of their optimisation and structural adaptation.</p><p>The applied constructive-synthesising approach and the developed tools are flexible for the formation of multifractals. It can be modified to generate not only geometric and planar fractals, largely using ready-to-use software.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Constructors list.</figDesc><graphic coords="4,170.39,384.89,258.75,207.90" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Adding a constructor with its identification.</figDesc><graphic coords="5,161.79,78.84,270.90,213.10" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Refining transformations of the constructor.</figDesc><graphic coords="5,150.34,460.34,268.15,175.95" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Specialization of the constructor: data.</figDesc><graphic coords="6,163.79,148.71,269.80,223.60" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Specialization of the constructor: operations.</figDesc><graphic coords="6,162.19,484.44,269.84,224.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: Specialization of the algorithmic constructor</figDesc><graphic coords="7,162.54,97.29,269.80,195.55" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Interpretation of the constructor.</figDesc><graphic coords="8,164.59,79.14,265.85,230.20" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 8 :</head><label>8</label><figDesc>Figure 8: Setting data values in concretization.</figDesc><graphic coords="8,152.44,342.49,265.85,183.65" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 9 :</head><label>9</label><figDesc>Figure 9: Adding substitution rules in concretization.</figDesc><graphic coords="9,164.59,85.24,265.85,191.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Figure 10 :</head><label>10</label><figDesc>Figure 10: Specialization of the multi-character constructor.</figDesc><graphic coords="10,173.79,146.79,247.15,178.55" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_10"><head>Figure 11 :</head><label>11</label><figDesc>Figure 11: Specialization of the algorithmic constructor for generating multi-character sequence.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_11"><head>Figure 12 :</head><label>12</label><figDesc>Figure 12: Interpretation of the multi-character constructor.</figDesc><graphic coords="10,160.64,391.49,274.35,199.30" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_12"><head>Figure 13 :</head><label>13</label><figDesc>Figure 13: Setting data values in concretization of the multi-character constructor.</figDesc><graphic coords="11,195.52,72.04,268.39,157.65" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_13"><head>Figure 14 :</head><label>14</label><figDesc>Figure 14: Adding substitution rules in concretization of the multi-character constructor.</figDesc><graphic coords="11,158.24,281.54,278.90,144.10" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_14"><head>Figure 15 :</head><label>15</label><figDesc>Figure 15: The order of realization the multi-character constructor.</figDesc><graphic coords="12,186.74,81.45,220.65,385.09" type="bitmap" /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Constructive-Synthesizing Structures and Their Grammatical Interpretations</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">I</forename><surname>Shynkarenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">M</forename><surname>Ilman</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-014-9655-z</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="issue">50</biblScope>
			<biblScope unit="page" from="665" to="662" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
	<note>Part I. Generalized Formal Constructive-Synthesizing Structure</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Part II. Refining Transformations</title>
		<idno type="DOI">10.1007/s10559-014-9674-9</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="issue">50</biblScope>
			<biblScope unit="page" from="829" to="841" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Grammatical theory: From transformational grammar to constraint-based approaches</title>
		<author>
			<persName><forename type="first">S</forename><surname>Müller</surname></persName>
		</author>
		<idno type="DOI">10.5281/zenodo.3992307</idno>
		<imprint>
			<date type="published" when="2023">2023</date>
			<publisher>Language Science Press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Parsing of Research Documents into XML Using Formal Grammars</title>
		<author>
			<persName><forename type="first">O</forename><surname>Iwashokun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ade-Ibijola</surname></persName>
		</author>
		<idno type="DOI">10.1155/2024/6671359</idno>
	</analytic>
	<monogr>
		<title level="m">Applied Computational Intelligence and Soft Computing</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">A stochastic grammar approach to mass classification in mammograms</title>
		<author>
			<persName><forename type="first">R</forename><surname>Wandr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">L S</forename><surname>Ferreira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">V S</forename><surname>Pessoa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Galv</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Machado-Lima</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE/ACM Transactions on Computational Biology and Bioinformatics</title>
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">A probabilistic grammar of graphics</title>
		<author>
			<persName><forename type="first">X</forename><surname>Pu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kay</surname></persName>
		</author>
		<idno type="DOI">10.1109/TCBB.2023.3247144</idno>
	</analytic>
	<monogr>
		<title level="m">CHI Conference on Human Factors in Computing Systems</title>
				<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="1" to="13" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">On finite-index indexed grammars and their restrictions</title>
		<author>
			<persName><forename type="first">F</forename><surname>D'alessandro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">H</forename><surname>Ibarra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Mcquillan</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ic.2020.104613</idno>
	</analytic>
	<monogr>
		<title level="m">International Conference on Language and Automata Theory and Application</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="287" to="298" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">The algorithmic beauty of plants</title>
		<author>
			<persName><forename type="first">P</forename><surname>Prusinkiewicz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lindenmayer</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-1-4613-8476-2</idno>
		<imprint>
			<date type="published" when="2004">2004</date>
			<publisher>Springer Science &amp; Business Media</publisher>
			<biblScope unit="page">228</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">A method of specification of fractal sets</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">P</forename><surname>Lisovik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">A</forename><surname>Karnaukh</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-009-9117-1</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="issue">45</biblScope>
			<biblScope unit="page" from="365" to="372" />
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Constructive-Synthesizing Representation of Geometric Fractals</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">I</forename><surname>Shynkarenko</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-019-00123-w</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="issue">55</biblScope>
			<biblScope unit="page" from="186" to="199" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Modeling the Adaptation of Compression Algorithms by Means of Constructive-Synthesizing Structures</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">I</forename><surname>Shynkarenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">M</forename><surname>Vasetska</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-015-9778-x</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="issue">51</biblScope>
			<biblScope unit="page" from="849" to="861" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Constructive Model of the Natural Language</title>
		<author>
			<persName><forename type="first">V</forename><surname>Shynkarenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kuropiatnyk</surname></persName>
		</author>
		<idno type="DOI">10.14232/actacyb.23.4.2018.2</idno>
	</analytic>
	<monogr>
		<title level="j">Acta Cybernetica</title>
		<imprint>
			<biblScope unit="issue">23</biblScope>
			<biblScope unit="page" from="995" to="1015" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Constructive-synthesizing modeling of fractal crystal lattices</title>
		<author>
			<persName><forename type="first">V</forename><surname>Shynkarenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Letuchyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Chyhir</surname></persName>
		</author>
		<idno type="DOI">10.1109/CSIT61576.2023.10324251</idno>
	</analytic>
	<monogr>
		<title level="m">18th IEEE International Conference on Computer Science and Information Technologies (CSIT)</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Modeling of Lightning Flashes in Thunderstorm Front by Constructive Production of Fractal Time Series</title>
		<author>
			<persName><forename type="first">V</forename><surname>Shynkarenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Chyhir</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Nikitina</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-33695-0_13</idno>
	</analytic>
	<monogr>
		<title level="m">Advances in Intelligent Systems and Computing IV</title>
				<imprint>
			<date type="published" when="1080">2020. 1080</date>
			<biblScope unit="page" from="173" to="185" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Constructive-synthesizing model of data structures at logical level</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">I</forename><surname>Shynkarenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">M</forename><surname>Ilman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Zabula</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Problems of programming</title>
				<imprint>
			<date type="published" when="2014">2014</date>
			<biblScope unit="page" from="10" to="16" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<title level="m" type="main">Handbook of Mathematics and Computational Science</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Harris</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Stocker</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1998">1998</date>
			<publisher>Springer-Verlag</publisher>
			<biblScope unit="page" from="114" to="115" />
			<pubPlace>New York</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
