A machine learning approach to synchronization of automata.
Saved in:
| Title: | A machine learning approach to synchronization of automata. |
|---|---|
| Authors: | Podolak, Igor1 podolak@ii.uj.edu.pl, Roman, Adam1 roman@ii.uj.edu.pl, Szykuła, Marek2 msz@cs.uni.wroc.pl, Zieliński, Bartosz1 zielinsb@ii.uj.edu.pl |
| Source: | Expert Systems with Applications. May2018, Vol. 97, p357-371. 15p. |
| Subjects: | Machine learning, Big data, Data mining, Numerical analysis, Mathematical analysis |
| Abstract: | We present a novel method to predict the length of the shortest synchronizing words of a finite automaton by applying the machine learning approach. We introduce several so-called automata features which depict the structure of an automaton, and use them with machine learning algorithms. The article discusses effectiveness of the machine learning approach in predicting the length of the shortest synchronizing words. We also examine the impact of particular features on this length, which may be helpful in methods of constructing automata as models of real systems, algorithms finding synchronizing words, and further theoretical research on synchronizing automata and the Černý conjecture. [ABSTRACT FROM AUTHOR] |
| Copyright of Expert Systems with Applications is the property of Pergamon Press - An Imprint of Elsevier Science 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: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 127441877 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A machine learning approach to synchronization of automata. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Podolak%2C+Igor%22">Podolak, Igor</searchLink><relatesTo>1</relatesTo><i> podolak@ii.uj.edu.pl</i><br /><searchLink fieldCode="AR" term="%22Roman%2C+Adam%22">Roman, Adam</searchLink><relatesTo>1</relatesTo><i> roman@ii.uj.edu.pl</i><br /><searchLink fieldCode="AR" term="%22Szykuła%2C+Marek%22">Szykuła, Marek</searchLink><relatesTo>2</relatesTo><i> msz@cs.uni.wroc.pl</i><br /><searchLink fieldCode="AR" term="%22Zieliński%2C+Bartosz%22">Zieliński, Bartosz</searchLink><relatesTo>1</relatesTo><i> zielinsb@ii.uj.edu.pl</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Expert+Systems+with+Applications%22">Expert Systems with Applications</searchLink>. May2018, Vol. 97, p357-371. 15p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Machine+learning%22">Machine learning</searchLink><br /><searchLink fieldCode="DE" term="%22Big+data%22">Big data</searchLink><br /><searchLink fieldCode="DE" term="%22Data+mining%22">Data mining</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We present a novel method to predict the length of the shortest synchronizing words of a finite automaton by applying the machine learning approach. We introduce several so-called automata features which depict the structure of an automaton, and use them with machine learning algorithms. The article discusses effectiveness of the machine learning approach in predicting the length of the shortest synchronizing words. We also examine the impact of particular features on this length, which may be helpful in methods of constructing automata as models of real systems, algorithms finding synchronizing words, and further theoretical research on synchronizing automata and the Černý conjecture. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Expert Systems with Applications is the property of Pergamon Press - An Imprint of Elsevier Science 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=egs&AN=127441877 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.eswa.2017.12.043 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 15 StartPage: 357 Subjects: – SubjectFull: Machine learning Type: general – SubjectFull: Big data Type: general – SubjectFull: Data mining Type: general – SubjectFull: Numerical analysis Type: general – SubjectFull: Mathematical analysis Type: general Titles: – TitleFull: A machine learning approach to synchronization of automata. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Podolak, Igor – PersonEntity: Name: NameFull: Roman, Adam – PersonEntity: Name: NameFull: Szykuła, Marek – PersonEntity: Name: NameFull: Zieliński, Bartosz IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2018 Type: published Y: 2018 Identifiers: – Type: issn-print Value: 09574174 Numbering: – Type: volume Value: 97 Titles: – TitleFull: Expert Systems with Applications Type: main |
| ResultId | 1 |
