Relevant bibliographies by topics / Non Deterministic Finite Automata (NFA)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Non Deterministic Finite Automata (NFA)'

Author: Grafiati
Published: 4 June 2025
Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Non Deterministic Finite Automata (NFA).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Non Deterministic Finite Automata (NFA)"

1

G., Mutyalamma, Komali K., and Pushpa G. "A Novel Algorithm for Reduction of Non Deterministic Finite Automata." International Journal of Trend in Scientific Research and Development 2, no. 1 (2017): 1341–46. https://doi.org/10.31142/ijtsrd8233.

Full text
Abstract:
In automata theory a minimization is the task of transforming a given finite state machine into an equivalent automation that has a minimum number of states. Here, the reduction of Deterministic Finite Automata DFA is very simple whereas Nondeterministic Finite Automata NFA is complex because which has maximium number of possible paths to reach new states. So a minimal NFA is a primal problem in automata theory. We consider the problem of approximating a minimal NFA or a minimal regular expression. There are several approaches to NFA minimization either without approximation guarantees or runn
APA, Harvard, Vancouver, ISO, and other styles
2

Câmpeanu, Cezar. "Non-Deterministic Finite Cover Automata." Scientific Annals of Computer Science XXV, no. 1 (2015): 3–28. https://doi.org/10.7561/SACS.2015.1.3.

Full text
Abstract:
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language using a Non-deterministic Finite Automata (NFA) may significantly reduce the number of required states. The combined power of the succinctness of the representation of finite languages using both cover languages and non-determinism has been suggested, but never systematically studied. In the present paper, for non-deterministic finite cover automata (NFCA) and l-non
APA, Harvard, Vancouver, ISO, and other styles
3

Pradana, Risqi. "Penerapan Konsep Non-deterministic Finite Automata Dalam Diagnosa Penyakit ISPA." TeIKa 13, no. 02 (2023): 121–30. http://dx.doi.org/10.36342/teika.v13i02.3143.

Full text
Abstract:
Infeksi Saluran Pernapasan Akut (ISPA) merupakan kondisi kesehatan umum dan serius di seluruh dunia. Diagnosa dini ISPA penting untuk penanganan yang tepat dan pengendalian penyebaran penyakit. Namun, proses diagnosa Infeksi Saluran Pernapasan Akut (ISPA) membutuhkan investasi waktu, biaya, dan keahlian yang signifikan. Itulah sebabnya, diperlukan suatu metode otomatis guna mendukung langkah-langkah diagnosa ISPA. Dalam penelitian ini, konsep Non-deterministic finite automata (NFA) diterapkan untuk melakukan diagnosa penyakit ISPA. NFA adalah model matematika yang dapat menggambarkan sistem ya
APA, Harvard, Vancouver, ISO, and other styles
4

WANG, YUE, KATSUSHI INOUE, and ITSUO TAKANAMI. "COOPERATING SYSTEMS OF THREE-WAY, TWO-DIMENSIONAL FINITE AUTOMATA." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 05 (1995): 797–811. http://dx.doi.org/10.1142/s021800149500033x.

Full text
Abstract:
This paper introduces a cooperating system of three-way, two-dimensional finite automata (CS-TR2-FA) which is a restricted version of a cooperating system of four- way, two-dimensional finite automata (CS-2-FA), and mainly investigates several fundamental properties of this system as a two-dimensional language acceptor whose input tapes are restricted to square ones. We show that (1) CS-TR2-FA’s are equivalent in accepting power to three-way, two-dimensional simple multihead finite automata, (2) CS-2-FA’s are more powerful than CS-TR2-FA’s, (3) £[CS-TR2-DFA(k)S] ⊊ £[CS-TR2-NFA(k)S], (4) ⋃1≤k&l
APA, Harvard, Vancouver, ISO, and other styles
5

Asrun, Budyanita, and Irmayani Irmayani. "Penerapan Konsep Non-Deterministic Finite Automata dalam Diagnosa Penyakit Jantung." Dewantara Journal of Technology 3, no. 1 (2022): 122–25. http://dx.doi.org/10.59563/djtech.v3i1.184.

Full text
Abstract:
Penyakit jantung merupakan salah satu penyakit yang mematikan di dunia. Serangan jantung mendadak seringkali merupakan pertanda terjadinya penyumbatan pembuluh darah yang menyebabkan aliran darah ke jantung menjadi terhambat. Untuk itu diperlukan suatu sistem konsep ilmu komputer yang dapat digunakan dalam membantu tenaga medis dalam mendiagnosa awal penyakit tersebut, sehingga pasien bisa lebih cepat menerima penanganan yang tepat. Non-Deterministic Finite Automata (NFA) merupakan salah satu konsep algoritma yang dapat diterapkan untuk memprediksi awal jenis penyakit jantung yang diderita ole
APA, Harvard, Vancouver, ISO, and other styles
6

Asrun, Budyanita, and Irmayani Irmayani. "Klasifikasi Stadium Kanker Serviks Menggunakan Non-Deterministic Finite State Automata." Dewantara Journal of Technology 2, no. 2 (2021): 75–78. http://dx.doi.org/10.59563/djtech.v2i2.135.

Full text
Abstract:
Kanker serviks atau kanker leher rahim adalah suatu penyakit yang menyerang sistem reproduksi pada wanita.Kanker ini adalah kanker yang terjadi pada area leher rahim yaitu bagian rahim yang menghubungkan rahim bagian atas dengan vagina. Kanker serviks disebabkan infeksi virus HPV(Human Papilloma Virus) atau virus papiloma manusia. HPV menimbulkan kutil pada pria maupun wanita, termasuk kutil pada kelamin yang disebut kondiloma akuminatum. Hanya beberapa saja dari ratusan varian HPV yang dapat menyebabkan kanker.Kanker serviks atau kanker leher rahim bisa terjadi jika terjadi infeksi yang tidak
APA, Harvard, Vancouver, ISO, and other styles
7

Yanto, Yanto, Dinar Ismunandar, Erni Erni, Santoso Setiawan, and Muhammad Ifan Rifani Ihsan. "Desain Game Edukasi Ilmu Tajwid Bagi Anak Usia Dini menggunakan Pemodelan Finite State Automata." Edumatic: Jurnal Pendidikan Informatika 5, no. 1 (2021): 80–88. http://dx.doi.org/10.29408/edumatic.v5i1.3317.

Full text
Abstract:
This study discusses how Finite State Automata (FSA) can be used as a model to design a Tajweed Science game application as a business diagram. This study aims to facilitate early childhood in learning the science of recitation by grouping hijaiyah letters into grouping the science of recitation by using a touch of the hand. The type of automata theory used is a non-deterministic finite automata with epsilon transition (E) or better known as E-NFA. Each transition, input, state that exists from the NFA, is basically to show the characteristics or states that occur in a game application. The im
APA, Harvard, Vancouver, ISO, and other styles
8

Cañadas, Agustín Moreno, Isaías David Marín Gaviria, and Juan David Camacho Vega. "Relationships between the Chicken McNugget Problem, Mutations of Brauer Configuration Algebras and the Advanced Encryption Standard." Mathematics 9, no. 16 (2021): 1937. http://dx.doi.org/10.3390/math9161937.

Full text
Abstract:
Mutations on Brauer configurations are introduced and associated with some suitable automata to solve generalizations of the Chicken McNugget problem. Additionally, based on marked order polytopes, the new Diophantine equations called Gelfand–Tsetlin equations are also solved. The approach allows algebraic descriptions of some properties of the AES key schedule via some Brauer configuration algebras and suitable non-deterministic finite automata (NFA).
APA, Harvard, Vancouver, ISO, and other styles
9

Supriyanto, Eko, Angga Ardiansyah, Frieyadie Frieyadie, Sri Rahayu, and Windu Gata. "Penerapan Finite State Automata Pada Vending Machine Penjual Obat Non Resep Dokter Dan Keperluan Medis." Jurnal Informasi dan Komputer 9, no. 2 (2021): 08–14. http://dx.doi.org/10.35959/jik.v9i2.206.

Full text
Abstract:
Kebutuhan obat non resep dokter dan keperluan medis menjadi salah satu kebutuhan yang sangat penting untuk dipenuhi dengan mudah,cepat, tepat, dan aman bagi masyarakat saat ini, beragamnya pilihan obat yang dijual mengharuskan masyarakat mampu memilih dengan cermat dan tepat dalam membeli obat sesuai dengan kebutuhan penyakit yang dialami,informasi tentang kandungan, aturan pakai dan efek samping dari obat juga sangat penting untuk diketahui masyarakat guna memaksimalkan maanfaat dari obat yang dikonsumsi. Sistem penjualan obat yang tersedia saat ini adalah dengan penjualan langsung di apotek,
APA, Harvard, Vancouver, ISO, and other styles
10

Desvia, Yessica Fara, Rosadi Rosadi, Frieyadie Frieyadie, Tuti Haryanti, and Windu Gata. "Penerapan Finite State Automata Pada Vending Machine Parfum Laundry Pakaian." BINA INSANI ICT JOURNAL 8, no. 2 (2021): 103. http://dx.doi.org/10.51211/biict.v8i2.1564.

Full text
Abstract:
Abstrak: Parfum banyak digemari oleh berbagai kalangan, salah satunya adalah parfum laundry. Parfum laundry memiliki berbagai macam varian aroma, meliputi aroma buah, aroma bunga, aroma perpaduan buah dan bunga, dan aroma kayu-kayuan. Parfum laundry ini merupakan rangkaian akhir dalam proses laundry. Saat ini pelanggan menerima hasil laundry dengan aroma parfum yang dipilih secara random sesuai ketersediaan pihak laundry, hal ini menjadi masalah karena pelanggan tidak dapat memilih aroma parfum laundry sesuai dengan keinginan mereka. Dengan alasan tersebut maka diperlukan suatu rancangan sebua
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Non Deterministic Finite Automata (NFA)"

1

Joly, Jean-Luc. "Contributions à la génération aléatoire pour des classes d'automates finis." Thesis, Besançon, 2016. http://www.theses.fr/2016BESA2012/document.

Full text
Abstract:
Le concept d’automate, central en théorie des langages, est l’outil d’appréhension naturel et efficace de nombreux problèmes concrets. L’usage intensif des automates finis dans un cadre algorithmique s ’illustre par de nombreux travaux de recherche. La correction et l’ évaluation sont les deux questions fondamentales de l’algorithmique. Une méthode classique d’ évaluation s’appuie sur la génération aléatoire contrôlée d’instances d’entrée. Les travaux d´écrits dans cette thèse s’inscrivent dans ce cadre et plus particulièrement dans le domaine de la génération aléatoire uniforme d’automates fi
APA, Harvard, Vancouver, ISO, and other styles
2

Kumar, Pawan. "Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems." Thesis, 2012. https://etd.iisc.ac.in/handle/2005/2321.

Full text
Abstract:
The rampant growth of the Internet has been coupled with an equivalent growth in cyber crime over the Internet. With our increased reliance on the Internet for commerce, social networking, information acquisition, and information exchange, intruders have found financial, political, and military motives for their actions. Network Intrusion Detection Systems (NIDSs) intercept the traffic at an organization’s periphery and try to detect intrusion attempts. Signature-based NIDSs compare the packet to a signature database consisting of known attacks and malicious packet fingerprints. The signatures
APA, Harvard, Vancouver, ISO, and other styles
3

Kumar, Pawan. "Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems." Thesis, 2012. http://etd.iisc.ernet.in/handle/2005/2321.

Full text
Abstract:
The rampant growth of the Internet has been coupled with an equivalent growth in cyber crime over the Internet. With our increased reliance on the Internet for commerce, social networking, information acquisition, and information exchange, intruders have found financial, political, and military motives for their actions. Network Intrusion Detection Systems (NIDSs) intercept the traffic at an organization’s periphery and try to detect intrusion attempts. Signature-based NIDSs compare the packet to a signature database consisting of known attacks and malicious packet fingerprints. The signatures
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Non Deterministic Finite Automata (NFA)"

1

Sannella, Donald, Michael Fourman, Haoran Peng, and Philip Wadler. "Non-deterministic Finite Automata." In Undergraduate Topics in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-76908-6_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pivneva, Svetlana V., Tatyana N. Ivanova, Galina V. Akhmetzhanova, Anastasia A. Kurilova, and Julia A. Anisimova. "Applying an Algorithm for Vertex Minimization of Non-deterministic Finite Automata (NFA) on the Basis of a Multi-heuristic Approach for Studying Social and Economic Performances of Region." In The Future of the Global Financial System: Downfall or Harmony. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00102-5_87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chakraborty, Sankardeep, Roberto Grossi, Kunihiko Sadakane, and Srinivasa Rao Satti. "Succinct Representations for (Non)Deterministic Finite Automata." In Language and Automata Theory and Applications. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68195-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Denis, François, Aurélien Lemay, and Alain Terlutte. "Learning Regular Languages Using Non Deterministic Finite Automata." In Grammatical Inference: Algorithms and Applications. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-45257-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kari, Jarkko, and Cristopher Moore. "New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata." In STACS 2001. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44693-1_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chocholatý, David, Tomáš Fiedor, Vojtěch Havlena, et al. "Mata: A Fast and Simple Finite Automata Library." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57249-4_7.

Full text
Abstract:
AbstractMata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library
APA, Harvard, Vancouver, ISO, and other styles
7

Fiedor, Tomáš, Lukáš Holík, Martin Hruška, Adam Rogalewicz, Juraj Síč, and Pavol Vargovčík. "Reasoning About Regular Properties: A Comparative Study." In Automated Deduction – CADE 29. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_17.

Full text
Abstract:
AbstractSeveral new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata have been proposed recently, especially in the context of analysing regular expressions and in string constraint solving. The new algorithms demonstrated a significant potential, but they have never been systematically compared, neither among each other nor with the state-of-the art implementations of existing (non)deterministic automata-based methods. In this paper, we provide such comparison as well as an overview of the existing algorithms and their imp
APA, Harvard, Vancouver, ISO, and other styles
8

Gallagher, John P., and Germán Puebla. "Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs." In Practical Aspects of Declarative Languages. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45587-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yellin, Daniel M., and Gail Weiss. "Synthesizing Context-free Grammars from Recurrent Neural Networks." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_19.

Full text
Abstract:
AbstractWe present an algorithm for extracting a subclass of the context free grammars (CFGs) from a trained recurrent neural network (RNN). We develop a new framework, pattern rule sets (PRSs), which describe sequences of deterministic finite automata (DFAs) that approximate a non-regular language. We present an algorithm for recovering the PRS behind a sequence of such automata, and apply it to the sequences of automata extracted from trained RNNs using the $$L^{*}$$ L ∗ algorithm. We then show how the PRS may converted into a CFG, enabling a familiar and useful presentation of the learned l
APA, Harvard, Vancouver, ISO, and other styles
10

Boker, Udi, and Guy Hefetz. "On the Comparison of Discounted-Sum Automata with Multiple Discount Factors." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_18.

Full text
Abstract:
AbstractWe look into the problems of comparing nondeterministic discounted-sum automata on finite and infinite words. That is, the problems of checking for automata $${\mathcal {A}}$$ A and $${\mathcal {B}}$$ B whether or not it holds that for all words w, $${\mathcal {A}}(w)={\mathcal {B}}(w), {\mathcal {A}}(w)\le {\mathcal {B}}(w)$$ A ( w ) = B ( w ) , A ( w ) ≤ B ( w ) , or $${\mathcal {A}}(w)<{\mathcal {B}}(w)$$ A ( w ) < B ( w ) .These problems are known to be decidable when both automata have the same single integral discount factor, while decidability is open in all other settings
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Non Deterministic Finite Automata (NFA)"

1

Mathew, Joel, Nishit Kumar, Sreeharsha Sadhu, and Niharika Panda. "Converting Regular Expressions to Non-Deterministic Finite Automata through an Automated Framework." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10724734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Heksaputra, Dadang, Rahmat Gernowo, and R. Rizal Isnanto. "Model for Bahasa Text Cleaning Based Regular Expression Non-Deterministic Finite Automata Approach." In 2024 International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS). IEEE, 2024. https://doi.org/10.1109/icimcis63449.2024.10956223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rajasekaran, Senthil, and Moshe Y. Vardi. "Verification and Realizability in Finite-Horizon Multiagent Systems." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/28.

Full text
Abstract:
The problems of verification and realizability are two central themes in the analysis of reactive systems. When multiagent systems are considered, these problems have natural analogues of existence (nonemptiness) of pure-strategy Nash equilibria and verification of pure-strategy Nash equilibria. Recently, this body of work has begun to include finite-horizon temporal goals. With finite-horizon temporal goals, there is a natural hierarchy of goal representation, ranging from deterministic finite automata (DFA), to nondeterministic finite automata (NFA), and to alternating finite automata (AFA),
APA, Harvard, Vancouver, ISO, and other styles
4

Pisal, Tulashiram B., Arjun P. Ghatule, and Pandurang M. Lawate. "Simple algorithm to construct deterministic finite automata from non-deterministic finite automata using initial state transitions successor." In THE 2ND UNIVERSITAS LAMPUNG INTERNATIONAL CONFERENCE ON SCIENCE, TECHNOLOGY, AND ENVIRONMENT (ULICoSTE) 2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0106219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brenna, Lars, Johannes Gehrke, Mingsheng Hong, and Dag Johansen. "Distributed event stream processing with non-deterministic finite automata." In the Third ACM International Conference. ACM Press, 2009. http://dx.doi.org/10.1145/1619258.1619263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

"Non-Deterministic Finite State Automata as Termites Swarm Agent Model." In 2017 the 7th International Workshop on Computer Science and Engineering. WCSE, 2017. http://dx.doi.org/10.18178/wcse.2017.06.055.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nourian, Marziyeh, Hancheng Wu, and Michela Becchi. "A Compiler Framework for Fixed-Topology Non-Deterministic Finite Automata on SIMD Platforms." In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2018. http://dx.doi.org/10.1109/padsw.2018.8644852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Avalle, Matteo, Fulvio Risso, and Riccardo Sisto. "Efficient multistriding of large non-deterministic finite state automata for deep packet inspection." In ICC 2012 - 2012 IEEE International Conference on Communications. IEEE, 2012. http://dx.doi.org/10.1109/icc.2012.6364235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rehman, Aniqa, Saba Latif, and Nazir Ahmad Zafar. "Formal Modeling of Smart office using Activity Diagram and Non Deterministic Finite Automata." In 2019 International Conference on Information Science and Communication Technology (ICISCT). IEEE, 2019. http://dx.doi.org/10.1109/cisct.2019.8777444.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Slaviero, Cleyton, and Edward Hermann Haeusler. "A-Games: using game-like representation for representing finite automata." In Workshop-Escola de Informática Teórica. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/weit.2021.18918.

Full text
Abstract:
Non-determinism in automata theory allows us to model situations where given an input, one or more outputs are possible. Although this decision regarding which state to chose could be random, there are contexts where this decision is not random, for instance when modeling real life situations. Using game theory, we propose the representation of automata as a game of two players. This game is defined for languages of finite size. We characterize that this representation is suited for both deterministic and non-deterministic automata, and relate the former with perfect information games, and the
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Non Deterministic Finite Automata (NFA)' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography