## 3 Results: AGA Logic Variables for Scene Description and Dialog Communications
### Communication Module and the Dialog Protocol
Nevertheless, the minimalistic scheme from logic LL, using block scheme in Figure 11, can be adapted for such a case. The version of LL should be the AGA function, which uses hash values and auxiliary formal tags as input variables, and the output value is to be the requested license ID. Here, one can use the pair of bound coded words \(w_{N}^{p,m}\) and \(w_{K}^{p,m}\). Such a pair of bound words can be regarded as the minimalistic logic data structure, which can be described and mixed within LL schemes. For reliability one can unite them in one logic expression, and verification procedure can check incompatible truth levels and natural numbers' codes. Following the formal definition proposed in [69], the AGA function for LL can be written by Eq. (8):

\[h_{v,m}^{(m,0)}=F_{vnd}\Big{(}w_{v,m}^{N},v,m,w_{v,m}^{K},h_{v,m}\Big{)}. \tag{8}\]

Such brief notation corresponds to the structure of the truth table shown in Table 8(a). For substituted input variables, Eq. (8) will output approving hash value \(h_{v,m}^{(m,0)}\), but due to verification task we want to obtain license ID. And here one can construct another version of LL for local data storages, providing direct output of the requested code word value. In fact, \(w_{K}^{v,m}\) values are also quasi-random hash values taken from QRNG, then one can quite freely permute them instead of quasi-random hash values, \(h_{v,m}^{(m,0)}\), earlier assigned by addresser. It is more convenient to use the variant of LL function given by Eq. (9) and Table 8(b), containing rearranged parameters, \(w_{K}^{v,m}\) and \(h_{v,m}^{(m,0)}\)

\[w_{v,m}^{K}=F_{vnd}\Big{(}w_{v,m}^{N},v,m,h_{v,m}^{(m,0)},h_{v,m}\Big{)}. \tag{9}\]

In fact, the sender's approving hash, \(h_{v,m}\), and addresser's hash one, \(h_{v,m}^{(m,0)}\), are randomly chosen paroles for the access to data in terminal's agent. Such version of adapted LL is realized in subroutine LLWRD in Section 6. Time moment stamps for entries are \(t_{m}\) and \(t_{m-1}\) can be additionally included into such LL for checks of loading/uploading time. ### Step 4: Software Modeling of Phrase Process, Adapted LL, and Actual Hardware Platform

Microassembler modeling for the function Eq. (9) of the adapted LL is presented in Section 6. Subroutine LLWRD demonstrates the calculation of AGA function, extracting requested parameter (license ID) from the LL function in the MCS-51 microcontroller platform. \begin{table}
\begin{tabular}{c c c c c} \hline \hline  & & **(a) Input Variables** & & **Output Variable** \\ \hline Word code in natural numbers, & Number of rows in vocabulary matrix, & Number of columns in vocabulary matrix, & Word code in truth levels, & Sender approving hash, & Addresser approving hash \\ \(w_{v,m}^{N}=\) & \(v=\{1\div 16\}\) & \(m=[1\div 16]\) & \(w_{v,m}^{K}=[1\div 256]\) & \(h_{v,m}^{(m,0)}=[1\div 256]\) & \(h^{(m,0)}=[1\div 256]\) \\ \hline  & & **(b) Input Variables** & & **Output Variable** \\ \hline Word code in natural numbers, & Number of rows in vocabulary matrix, & Number of columns in vocabulary matrix, & Addresser & Sender approving hash, & Word code in truth levels, \\ \(w_{v,m}^{N}=[1\div 16]\) & \(v=\{1\div 16\}\) & \(m=[1\div 16]\) & \(h_{v,m}^{(m,0)}=[1\div 256]\) & \(h_{v,m}^{(m,0)}=[1\div 256]\) \\ \hline \hline \end{tabular}
\end{table} 
Table 8: Structure of the truth table for adapted versions of LL, given by AGA function. (**a**) Version following basic definition of AGA-based LL [69]. (**b**) Version with replaced quasi-random hash values. In addition, verification algorithms can be supplemented by human checks, and their base is disclosed in Section 5. It demonstrates the scheme to receive low-dimensional diagrams from arbitrary AGA functions, including LL logic functions. ### Alternative Versions of AGA-Based LL

The formation of more complicated versions of adapted LL function should take into account that AGA-based version of LL [68; 69] initially supposes equal dimension of all entries.