Recognizable languages of k-forcing automata
dc.contributor.author | Shamsizadeh, Marzieh | |
dc.contributor.author | Zahedi, Mohammad Mehdi | |
dc.contributor.author | Abolpour, Khadijeh | |
dc.contributor.author | De la Sen Parte, Manuel ![]() | |
dc.date.accessioned | 2024-06-27T14:55:15Z | |
dc.date.available | 2024-06-27T14:55:15Z | |
dc.date.issued | 2024-04-25 | |
dc.identifier.citation | Mathematical and Computational Applications 29(3) : (2024) // Article ID 32 | es_ES |
dc.identifier.issn | 2297-8747 | |
dc.identifier.uri | http://hdl.handle.net/10810/68685 | |
dc.description.abstract | In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs. Moreover, we study and discuss the language of k-forcing automata for particular graphs. Also, for some graphs with different k-forcing sets, we study the languages of their k-forcing automata. In addition, for some given recognizable languages, we study the structure of graphs. After that, we show that k-forcing automata arising from isomorph graphs are also isomorph. Also, we present the style of words that can be recognized with k-forcing automata. Moreover, we introduce the structure of graphs the k-forcing automata arising from which recognize some particular languages. To clarify the notions and the results obtained in this study, some examples are submitted as well. | es_ES |
dc.description.sponsorship | This research was partially funded by Basque Government grant number IT1555-22 and funded by MICIU/AEI/10.13039/501100011033 and ERDF/E through Grants PID2021-123543OBC21 and PID2021-123543OB-C22. | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | MDPI | es_ES |
dc.relation | info:eu-repo/grantAgreement/MICINN/PID2021-123543OBC21 | es_ES |
dc.relation | info:eu-repo/grantAgreement/MICINN/PID2021-123543OBC22 | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/es/ | |
dc.subject | graph | es_ES |
dc.subject | zero forcing set | es_ES |
dc.subject | k-forcing | es_ES |
dc.subject | automata | es_ES |
dc.subject | network | es_ES |
dc.title | Recognizable languages of k-forcing automata | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.date.updated | 2024-06-26T13:22:40Z | |
dc.rights.holder | © 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/ 4.0/). | es_ES |
dc.relation.publisherversion | https://www.mdpi.com/2297-8747/29/3/32 | es_ES |
dc.identifier.doi | 10.3390/mca29030032 | |
dc.departamentoes | Electricidad y electrónica | |
dc.departamentoeu | Elektrizitatea eta elektronika |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as © 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/ 4.0/).