Academic Journal
АЛГОРИТМИ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГО АВТОМАТА НА ОСНОВІ ПІДБОРУ КОДІВ СТАНІВ.
| Τίτλος: | АЛГОРИТМИ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГО АВТОМАТА НА ОСНОВІ ПІДБОРУ КОДІВ СТАНІВ. (Ukrainian) |
|---|---|
| Alternate Title: | ALGORITHMS FOR ALGEBRAIC SYNTHESIS OF A FINITE STATE MACHINE BASED ON STATE CODE SELECTION. (English) |
| Συγγραφείς: | БАБАКОВ, Р. М., БАРКАЛОВ, О. О. |
| Πηγή: | Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz; 2026, Issue 5, p3-13, 11p |
| Θεματικοί όροι: | Finite state machines, Logic circuit design, Mathematical optimization, Computer software execution |
| Περίληψη: | For a finite state machine with data path of transitions, two modifications of known algebraic synthesis algorithms are proposed, combining the enumeration of state coding variants with a special algorithm for selecting codes for each state of the state machine. The algorithm for selecting state codes is based on the analysis of a set of codes that are not currently used to encode any state of the state machine, although they are admissible for use. For each state of the state machine, a code is selected from the set of unused codes that allows to minimize the number of transitions not covered by a given set of operations. Studies have shown that the combination of the enumeration of state coding variants with the selection of state codes allows to find formal solutions to the algebraic synthesis problem that have a smaller number of uncovered transitions and lead to lower hardware expenses in the logic circuit of a finite state machine with data path of transitions. A software implementation of the proposed algorithms was performed, which confirmed their 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.) | |
| Βάση Δεδομένων: | Complementary Index |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 197021345 RelevancyScore: 1082 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1082.42749023438 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: АЛГОРИТМИ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГО АВТОМАТА НА ОСНОВІ ПІДБОРУ КОДІВ СТАНІВ. (Ukrainian) – Name: TitleAlt Label: Alternate Title Group: TiAlt Data: ALGORITHMS FOR ALGEBRAIC SYNTHESIS OF A FINITE STATE MACHINE BASED ON STATE CODE SELECTION. (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 5, p3-13, 11p – 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="%22Logic+circuit+design%22">Logic circuit design</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+execution%22">Computer software execution</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: For a finite state machine with data path of transitions, two modifications of known algebraic synthesis algorithms are proposed, combining the enumeration of state coding variants with a special algorithm for selecting codes for each state of the state machine. The algorithm for selecting state codes is based on the analysis of a set of codes that are not currently used to encode any state of the state machine, although they are admissible for use. For each state of the state machine, a code is selected from the set of unused codes that allows to minimize the number of transitions not covered by a given set of operations. Studies have shown that the combination of the enumeration of state coding variants with the selection of state codes allows to find formal solutions to the algebraic synthesis problem that have a smaller number of uncovered transitions and lead to lower hardware expenses in the logic circuit of a finite state machine with data path of transitions. A software implementation of the proposed algorithms was performed, which confirmed their 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=197021345 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.34229/KCA2522-9664.26.5.1 Languages: – Code: ukr Text: Ukrainian PhysicalDescription: Pagination: PageCount: 11 StartPage: 3 Subjects: – SubjectFull: Finite state machines Type: general – SubjectFull: Logic circuit design Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Computer software execution Type: general Titles: – TitleFull: АЛГОРИТМИ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГО АВТОМАТА НА ОСНОВІ ПІДБОРУ КОДІВ СТАНІВ. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: БАБАКОВ, Р. М. – PersonEntity: Name: NameFull: БАРКАЛОВ, О. О. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: 2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 10195262 Numbering: – Type: issue Value: 5 Titles: – TitleFull: Cybernetics & Systems Analysis / Kibernetyka ta Systemnyi Analiz Type: main |
| ResultId | 1 |