Academic Journal
АЛГОРИТМ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГОАВТОМАТА НА ОСНОВІ ПЕРЕБОРУ ОПЕРАЦІЙ.
| Title: | АЛГОРИТМ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГОАВТОМАТА НА ОСНОВІ ПЕРЕБОРУ ОПЕРАЦІЙ. (Ukrainian) |
|---|---|
| Alternate Title: | ALGORITHM FOR ALGEBRAIC SYNTHESIS OF A FINITE STATE MACHINE BASED ON OPERATIONS ENUMERATION. (English) |
| Authors: | БАБАКОВ, Р. М., БАРКАЛОВ, О. О. |
| Source: | Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz; 2026, Issue 1, p16-25, 10p |
| Subject Terms: | Finite state machines, Algorithms, Computer software execution, Boolean expressions |
| Abstract: | For a finite state machine with a datapath of transitions, a new algebraic synthesis algorithm is proposed that combines the enumeration of state coding ways with the enumeration of transition operations. The algorithm is based on the representation of any transition operation in the form of an arithmetic-logical operator over two operands, which are the code of the state machine's current state and a constant of the corresponding format. This allows you to automate the enumeration of transition operations by enumerating the constants in the used operations within the range of values of the state codes of the finite state machine. The result of the algorithm is a set of solutions of the algebraic synthesis problem, each of which contains values of the state codes and a set of values of the constants of the used operations. The combination of enumeration of transition operations with enumeration of state coding ways expands the search area and increases the number of solutions found for the algebraic synthesis problem compared to the prototype algorithm that does not use enumeration of transition operations. A software implementation of the proposed algorithm was performed, confirming its correctness and effectiveness. [ABSTRACT FROM AUTHOR] |
| Copyright of Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz is the property of V.M. Glushkov Institute of Cybernetics of NAS of Ukraine and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 190704166 RelevancyScore: 1041 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1041.06604003906 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: АЛГОРИТМ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГОАВТОМАТА НА ОСНОВІ ПЕРЕБОРУ ОПЕРАЦІЙ. (Ukrainian) – Name: TitleAlt Label: Alternate Title Group: TiAlt Data: ALGORITHM FOR ALGEBRAIC SYNTHESIS OF A FINITE STATE MACHINE BASED ON OPERATIONS ENUMERATION. (English) – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22БАБАКОВ%2C+Р%2E+М%2E%22">БАБАКОВ, Р. М.</searchLink><br /><searchLink fieldCode="AR" term="%22БАРКАЛОВ%2C+О%2E+О%2E%22">БАРКАЛОВ, О. О.</searchLink> – Name: TitleSource Label: Source Group: Src Data: Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz; 2026, Issue 1, p16-25, 10p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Finite+state+machines%22">Finite state machines</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+execution%22">Computer software execution</searchLink><br /><searchLink fieldCode="DE" term="%22Boolean+expressions%22">Boolean expressions</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: For a finite state machine with a datapath of transitions, a new algebraic synthesis algorithm is proposed that combines the enumeration of state coding ways with the enumeration of transition operations. The algorithm is based on the representation of any transition operation in the form of an arithmetic-logical operator over two operands, which are the code of the state machine's current state and a constant of the corresponding format. This allows you to automate the enumeration of transition operations by enumerating the constants in the used operations within the range of values of the state codes of the finite state machine. The result of the algorithm is a set of solutions of the algebraic synthesis problem, each of which contains values of the state codes and a set of values of the constants of the used operations. The combination of enumeration of transition operations with enumeration of state coding ways expands the search area and increases the number of solutions found for the algebraic synthesis problem compared to the prototype algorithm that does not use enumeration of transition operations. A software implementation of the proposed algorithm was performed, confirming its correctness and effectiveness. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz is the property of V.M. Glushkov Institute of Cybernetics of NAS of Ukraine and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=190704166 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: ukr Text: Ukrainian PhysicalDescription: Pagination: PageCount: 10 StartPage: 16 Subjects: – SubjectFull: Finite state machines Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Computer software execution Type: general – SubjectFull: Boolean expressions Type: general Titles: – TitleFull: АЛГОРИТМ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГОАВТОМАТА НА ОСНОВІ ПЕРЕБОРУ ОПЕРАЦІЙ. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: БАБАКОВ, Р. М. – PersonEntity: Name: NameFull: БАРКАЛОВ, О. О. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 10195262 Numbering: – Type: issue Value: 1 Titles: – TitleFull: Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz Type: main |
| ResultId | 1 |