Acceder

Bibliografías temáticas / Finite state automata / Artículos de revistas

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Finite state automata.

Artículos de revistas sobre el tema "Finite state automata"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 9 de junio de 2025

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Finite state automata".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Denis, François, Aurélien Lemay, and Alain Terlutte. "Residual Finite State Automata." Fundamenta Informaticae 51, no. 4 (January 2002): 339–68. https://doi.org/10.3233/fun-2002-51402.

Texto completo

Resumen

We define a new variety of Nondeterministic Finite Automata (NFA): a Residual Finite State Automaton (RFSA) is an NFA all the states of which define residual languages of the language L that it recognizes; a residual language according to a word u is the set of words v such that uv is in L. We prove that every regular language is recognized by a unique (canonical) RFSA which has a minimal number of states and a maximal number of transitions. Canonical RFSAs are based on the notion of prime residual languages, i.e. that are not the union of other residual languages. We provide an algorithmic co

Los estilos APA, Harvard, Vancouver, ISO, etc.

2

BASU, SUMITA. "ROUGH FINITE-STATE AUTOMATA." Cybernetics and Systems 36, no. 2 (January 18, 2005): 107–24. http://dx.doi.org/10.1080/01969720590887324.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

3

Sánchez, Joan Andreu, Martha Alicia Rocha, Verónica Romero, and Mauricio Villegas. "On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models." Computational Linguistics 44, no. 1 (March 2018): 17–37. http://dx.doi.org/10.1162/coli_a_00306.

Texto completo

Resumen

Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing. Probabilistic finite-state automata are closely related to other finite-state models as weighted finite-state automata, word lattices, and hidden Markov models. Therefore, they share many similar properties and problems. Entropy measures of finite-state models have been investigated in the past in order to study the information capacity of these models. The derivational entropy quantifies the uncertainty that the model has about the probabili

Los estilos APA, Harvard, Vancouver, ISO, etc.

4

Kaunang, Fergie Joanda, and Jacquline Waworundeng. "Implementation of Finite State Automata in an Amusement Park Automatic Ticket Selling Machine." Abstract Proceedings International Scholars Conference 7, no. 1 (December 18, 2019): 1776–85. http://dx.doi.org/10.35974/isc.v7i1.1979.

Texto completo

Resumen

Introduction: Amusement Park is a place that provides various attractions for entertainment purpose. People can enjoy games, rides such as roller coaster rides, merry-go-round, etc. Over the time, technology has grown. Many things that are usually done manually by humans are now being replaced by computers. With an automated ticket selling machine, the process of buying the ticket of an amusement park becomes easier for the user. Automata theory is a theoretical branch that has not been widely known to many yet plays essential role in the field of computer science. The main concept of automata

Los estilos APA, Harvard, Vancouver, ISO, etc.

5

Alawida, Moatsum, Azman Samsudin, Je Sen Teh, and Wafa’ Hamdan Alshoura. "Deterministic chaotic finite-state automata." Nonlinear Dynamics 98, no. 3 (October 25, 2019): 2403–21. http://dx.doi.org/10.1007/s11071-019-05311-z.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

6

Wang, Z. G., J. Elbaz, F. Remacle, R. D. Levine, and I. Willner. "All-DNA finite-state automata with finite memory." Proceedings of the National Academy of Sciences 107, no. 51 (December 6, 2010): 21996–2001. http://dx.doi.org/10.1073/pnas.1015858107.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

7

Benson, Karl. "Performing automatic target detection with evolvable finite state automata." Image and Vision Computing 20, no. 9-10 (August 2002): 631–38. http://dx.doi.org/10.1016/s0262-8856(02)00052-5.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

8

RiXian Liu. "L-Fuzzy ��-Finite state Buchi automata." International Journal of Advancements in Computing Technology 5, no. 3 (February 15, 2013): 738–44. http://dx.doi.org/10.4156/ijact.vol5.issue3.86.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

9

Majumdar, Dipankar, and Swapan Bhattacharya. "Interoperability of constrained finite state automata." ACM SIGSOFT Software Engineering Notes 37, no. 2 (April 3, 2012): 1–8. http://dx.doi.org/10.1145/2108144.2108155.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

10

Quenneville, Charles. "Image coding using finite state automata." Optical Engineering 35, no. 1 (January 1, 1996): 113. http://dx.doi.org/10.1117/1.600881.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

11

Steinberg, Benjamin. "Finite state automata: A geometric approach." Transactions of the American Mathematical Society 353, no. 9 (May 4, 2001): 3409–64. http://dx.doi.org/10.1090/s0002-9947-01-02774-x.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

12

Daciuk, Jan, and Dawid Weiss. "Smaller representation of finite state automata." Theoretical Computer Science 450 (September 2012): 10–21. http://dx.doi.org/10.1016/j.tcs.2012.04.023.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

13

Sharan, Shambhu, Arun K. Srivastava, and S. P. Tiwari. "Characterizations of rough finite state automata." International Journal of Machine Learning and Cybernetics 8, no. 3 (May 7, 2015): 721–30. http://dx.doi.org/10.1007/s13042-015-0372-3.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

14

Kryvyi, S. L. "Finite-state automata in information technologies." Cybernetics and Systems Analysis 47, no. 5 (September 2011): 669–83. http://dx.doi.org/10.1007/s10559-011-9347-x.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

15

BORDIHN, HENNING, MARKUS HOLZER, and MARTIN KUTRIB. "HYBRID EXTENDED FINITE AUTOMATA." International Journal of Foundations of Computer Science 18, no. 04 (August 2007): 745–60. http://dx.doi.org/10.1142/s0129054107004954.

Texto completo

Resumen

Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations. In this paper, five word operations are taken into consideration which always yield letter-equivalent results, namely reversal and shift operations. The computational power of those machines is investigated, locating the corresponding families of languages in the Chomsky hierarchy. Furthermore, different types of hybrid extended finite

Los estilos APA, Harvard, Vancouver, ISO, etc.

16

Kavikumar, J., S. P. Tiwari, Nur Ain Ebas, and A. H. Nor Shamsidah. "General Fuzzy Finite Switchboard Automata." New Mathematics and Natural Computation 15, no. 02 (June 20, 2019): 283–305. http://dx.doi.org/10.1142/s1793005719500157.

Texto completo

Resumen

The constructions of finite switchboard state automata are known to be an extension of finite automata in the view of commutative and switching state machines. This research incorporated an idea of a switchboard in the general fuzzy automata to introduce general fuzzy finite switchboard automata. The attained output reveals that a strongly connected general fuzzy finite switchboard automaton is equivalent to the retrievable general fuzzy automata. Further, the notion of the switchboard subsystem and strong switchboard subsystem of general fuzzy finite switchboard automata are examined. Finally

Los estilos APA, Harvard, Vancouver, ISO, etc.

17

Carrasco, Rafael C., and Mikel L. Forcada. "Incremental Construction and Maintenance of Minimal Finite-State Automata." Computational Linguistics 28, no. 2 (June 2002): 207–16. http://dx.doi.org/10.1162/089120102760173652.

Texto completo

Resumen

Daciuk et al. [Computational Linguistics 26(1):3–16 (2000)] describe a method for constructing incrementally minimal, deterministic, acyclic finite-state automata (dictionaries) from sets of strings. But acyclic finite-state automata have limitations: For instance, if one wants a linguistic application to accept all possible integer numbers or Internet addresses, the corresponding finite-state automaton has to be cyclic. In this article, we describe a simple and equally efficient method for modifying any minimal finite-state automaton (be it acyclic or not) so that a string is added to or remo

Los estilos APA, Harvard, Vancouver, ISO, etc.

18

MACARIE, IOAN I. "A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA." International Journal of Foundations of Computer Science 07, no. 04 (December 1996): 329–37. http://dx.doi.org/10.1142/s0129054196000233.

Texto completo

Resumen

We present connections among nondeterministic and one-sided-error probabilistic multihead finite-state automata. Several properties of logarithmic-space Turing machines follow from the more refined results that we prove in the setting of the corresponding multihead finite-state automata.

Los estilos APA, Harvard, Vancouver, ISO, etc.

19

Susanto, Susanto, Venny Yulianty, Bobby Suryo Prakoso, Suwanda Suwanda, Windu Gata, and Kresna Ramanda. "Desain Finite State Automata Untuk Merancang Vending Automata Logam Mulia." BINA INSANI ICT JOURNAL 8, no. 2 (December 13, 2021): 113. http://dx.doi.org/10.51211/biict.v8i2.1572.

Texto completo

Resumen

Abstrak: Menabung logam mulia merupakan investasi yang dianggap safe haven, ditengah era modern saat ini menabung logam mulia dapat dilakukan dengan cara dicicil, sedangkan yang menjadi masalahnya adalah kekhawatiran ketika fisik logam mulia tidak dapat ditarik fisiknya yang membuat potensi fraud atau investasi bodong yang sedang marak saat ini, untuk mengatasi masalah itu penjualan logam mulia dapat dikembangkan menjadi lebih menarik dengan vending machine, untuk memperdalam pemahaman mengenai salah satu model komputasi yang mendasar dan pengenalan Internet of Things (IoT), desain vending mac

Los estilos APA, Harvard, Vancouver, ISO, etc.

20

Lediwara, Nadiza, Aulia Khamas Heikmakhtiar, Sembada Denrineksa Bimorogo, Alfian Habib Ahmed, and Rizki Yulian Agusti. "Implementation of Finite State Automata to Simulation of Automatic Clothes-Folding." Jurnal Teknologi Sistem Informasi dan Aplikasi 6, no. 4 (October 30, 2023): 783–87. http://dx.doi.org/10.32493/jtsi.v6i4.34226.

Texto completo

Resumen

Inconsistencies and differences clothes-folding methods are often a major problem in the military. Everyone has thier method to fold and their method is still traditional. Besides, the neatness of the clothes in the military is emphasized. This method certainly took up their time and energy then the folding was different to each other. To solve this problem, a simulation machine is made to fold the clothes automatically. This system works using Finite State Automa type Non-Deterministic Finite Automata. Finite State Automata are used because they are simple and do not require storage space. Th

Los estilos APA, Harvard, Vancouver, ISO, etc.

21

SALOMAA, KAI, and PAUL SCHOFIELD. "STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA." International Journal of Foundations of Computer Science 18, no. 06 (December 2007): 1407–16. http://dx.doi.org/10.1142/s0129054107005443.

Texto completo

Resumen

It is known that the neighborhood of a regular language with respect to an additive distance is regular. We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result. We consider the state complexity of converting additive weighted finite automata to deterministic finite automata. As our main result we establish a tight upper bound for the state complexity of the conversion.

Los estilos APA, Harvard, Vancouver, ISO, etc.

22

Nagy, Benedek. "State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters." Electronic Proceedings in Theoretical Computer Science 386 (September 3, 2023): 170–84. http://dx.doi.org/10.4204/eptcs.386.14.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

23

PIGHIZZINI, GIOVANNI, and ANDREA PISONI. "LIMITED AUTOMATA AND REGULAR LANGUAGES." International Journal of Foundations of Computer Science 25, no. 07 (November 2014): 897–916. http://dx.doi.org/10.1142/s0129054114400140.

Texto completo

Resumen

Limited automata are one-tape Turing machines that are allowed to rewrite the content of any tape cell only in the first d visits, for a fixed constant d. In the case d = 1, namely, when a rewriting is possible only during the first visit to a cell, these models have the same power of finite state automata. We prove state upper and lower bounds for the conversion of 1-limited automata into finite state automata. In particular, we prove a double exponential state gap between nondeterministic 1-limited automata and one-way deterministic finite automata. The gap reduces to a single exponential in

Los estilos APA, Harvard, Vancouver, ISO, etc.

24

BOUMA, GOSSE. "Finite state methods for hyphenation." Natural Language Engineering 9, no. 1 (March 2003): 5–20. http://dx.doi.org/10.1017/s1351324903003073.

Texto completo

Resumen

Hyphenation is the task of identifying potential hyphenation points inwords. In this paper, three finite-state hyphenation methods for Dutch are presented and compared in terms of accuracy and size of the resulting automata.

Los estilos APA, Harvard, Vancouver, ISO, etc.

25

Paramitha, I. Gusti Bagus Arya Pradnja, Windu Gata, Laela Kurniawati, Eni Heni Hermaliani, and Jordy Lasmana Putra. "Penerapan Finite State Automata Pada Desain Vending Machine Batu Permata Sapphire Alami." J-SISKO TECH (Jurnal Teknologi Sistem Informasi dan Sistem Komputer TGD) 5, no. 2 (July 16, 2022): 144. http://dx.doi.org/10.53513/jsk.v5i2.5677.

Texto completo

Resumen

Batu Sapphire adalah salah satu jenis batu permata yang ada di dunia, yang paling di cari serta di minati oleh para penggemarnya adalah batu permata Sapphire berwarna biru. Untuk memudahkan penjualan batu permata Sapphire alami adalah dengan menggunakan Vending machine. Metode penelitian dengan melakukan penggambaran Finite State Automata menggunakan Deterministic Finite Automata, perancangan Diagram State tentang fitur-fitur dan desain antarmuka saat Vending machine diimplementasikan. Hasil penelitian menunjukkan penggunaan Deterministic Finite Automata pada desain Vending machine Batu Permat

Los estilos APA, Harvard, Vancouver, ISO, etc.

26

Kari, Jarkko. "Synchronization and Stability of Finite Automata." JUCS - Journal of Universal Computer Science 8, no. (2) (February 28, 2002): 270–77. https://doi.org/10.3217/jucs-008-02-0270.

Texto completo

Resumen

Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors in such a way that each vertex has one edge of each color leaving it. The automaton is called synchronized if there exists an input word that maps all vertices into the same fixed vertex. The road coloring conjecture asks whether there always exists a coloring such that the resulting automaton is synchronized. The conjecture has been proved for various types of graphs but the general problem remains open. In this work w

Los estilos APA, Harvard, Vancouver, ISO, etc.

27

Câmpeanu, Cezar. "Two Extensions of Cover Automata." Axioms 10, no. 4 (December 10, 2021): 338. http://dx.doi.org/10.3390/axioms10040338.

Texto completo

Resumen

Deterministic Finite Cover Automata (DFCA) are compact representations of finite languages. Deterministic Finite Automata with “do not care” symbols and Multiple Entry Deterministic Finite Automata are both compact representations of regular languages. This paper studies the benefits of combining these representations to get even more compact representations of finite languages. DFCAs are extended by accepting either “do not care” symbols or considering multiple entry DFCAs. We study for each of the two models the existence of the minimization or simplification algorithms and their computation

Los estilos APA, Harvard, Vancouver, ISO, etc.

28

Kaur, Ranjeet, and Alka Tripathi. "State Minimization of General Finite Fuzzy Automata." International Journal of Mathematical, Engineering and Management Sciences 6, no. 6 (December 1, 2021): 1709–28. http://dx.doi.org/10.33889/ijmems.2021.6.6.101.

Texto completo

Resumen

The minimization of automaton is important to reduce space and computational time. Reduction in number of states and transitions leads to equivalent automaton with less number of states and transitions. In this paper, state minimization of General Finite Fuzzy Automata (GFFA) is discussed. To obtain minimal equivalent GFFA we have removed redundant states and transitions using substitution property (SP) partition and quotient machine. The algorithm to find membership values of states of the GFFA is described and algorithm to associate states with quotient machine to obtain minimal machine with

Los estilos APA, Harvard, Vancouver, ISO, etc.

29

Badr, Andrew, Viliam Geffert, and Ian Shipman. "Hyper-minimizing minimized deterministic finite state automata." RAIRO - Theoretical Informatics and Applications 43, no. 1 (December 20, 2007): 69–94. http://dx.doi.org/10.1051/ita:2007061.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

30

Reger, Johann. "CYCLE ANALYSIS FOR DETERMINISTIC FINITE STATE AUTOMATA." IFAC Proceedings Volumes 35, no. 1 (2002): 247–52. http://dx.doi.org/10.3182/20020721-6-es-1901.00529.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

31

Jindal, Rajni, and Shraddha Singhai. "Finite State Automata Evolution Using Modular Architecture." Journal of Algorithms & Computational Technology 4, no. 4 (December 2010): 495–509. http://dx.doi.org/10.1260/1748-3018.4.4.495.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

32

Ray *, Asok, Jinbo Fu, and Constantino Lagoa. "Optimal supervisory control of finite state automata." International Journal of Control 77, no. 12 (August 15, 2004): 1083–100. http://dx.doi.org/10.1080/0020717042000273762.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

33

Goldberg, Robert R., and Jerry Waxman. "Parallel decision procedures for finite state automata." International Journal of Computer Mathematics 49, no. 1-2 (January 1993): 33–40. http://dx.doi.org/10.1080/00207169308804213.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

34

Cleeremans, Axel, David Servan-Schreiber, and James L. McClelland. "Finite State Automata and Simple Recurrent Networks." Neural Computation 1, no. 3 (September 1989): 372–81. http://dx.doi.org/10.1162/neco.1989.1.3.372.

Texto completo

Resumen

We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step t−1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns on the hidden units come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to

Los estilos APA, Harvard, Vancouver, ISO, etc.

35

Arulprakasam, R., R. Perumal, M. Radhakrishnan, and V. R. Dare. "Rough Finite State Automata and Rough Languages." Journal of Physics: Conference Series 1000 (April 2018): 012155. http://dx.doi.org/10.1088/1742-6596/1000/1/012155.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

36

Ganesh, Natesh, and Neal G. Anderson. "Irreversibility and dissipation in finite-state automata." Physics Letters A 377, no. 45-48 (December 2013): 3266–71. http://dx.doi.org/10.1016/j.physleta.2013.10.010.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

37

Bala, Vasanth, and Norman Rubin. "Efficient instruction scheduling using finite state automata." International Journal of Parallel Programming 25, no. 2 (April 1997): 53–82. http://dx.doi.org/10.1007/bf02700047.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

38

NISHIKAWA, TOSHITAMI, and YASUHIKO TAKAHARA. "CHARACTERIZATION OF FINITE STATE AUTOMATA—TOPOLOGICAL APPROACH." International Journal of General Systems 20, no. 3 (March 1992): 221–31. http://dx.doi.org/10.1080/03081079208945032.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

39

Dzelme-Bērziņa, Ilze. "Mathematical logic and quantum finite state automata." Theoretical Computer Science 410, no. 20 (May 2009): 1952–59. http://dx.doi.org/10.1016/j.tcs.2009.01.030.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

40

Jonoska, Nataša, and Joni B. Pirnot. "Finite state automata representing two-dimensional subshifts." Theoretical Computer Science 410, no. 37 (September 2009): 3504–12. http://dx.doi.org/10.1016/j.tcs.2009.03.015.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

41

Ganguly, Debayan, Kingshuk Chatterjee, and Kumar Sankar Ray. "1-Way Multihead Quantum Finite State Automata." Applied Mathematics 07, no. 09 (2016): 1005–22. http://dx.doi.org/10.4236/am.2016.79088.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

42

Goldberg, R. R. "Finite State Automata from Regular Expression Trees." Computer Journal 36, no. 7 (July 1, 1993): 623–30. http://dx.doi.org/10.1093/comjnl/36.7.623.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

43

Shemesh, Y., and N. Francez. "Finite-State Unification Automata and Relational Languages." Information and Computation 114, no. 2 (November 1994): 192–213. http://dx.doi.org/10.1006/inco.1994.1085.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

44

Ćirić, Miroslav, Ivana Micić, Stefan Stanimirović, and Linh Anh Nguyen. "Approximate State Reduction of Fuzzy Finite Automata." Electronic Proceedings in Theoretical Computer Science 386 (September 3, 2023): 51–66. http://dx.doi.org/10.4204/eptcs.386.6.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

45

Saputra, Fajar Ananda, F. Ti Ayyu Sayyidul Laily, Dimas Prasetyo Buseri, Imro’aturrozaniyah Imro’aturrozaniyah, and Kartika Candra Kirana. "“M-Auto” The Augmented Reality-Based (AR) Learning Media Application for the Finite-State Automata (FA) Reduction Subject of Language and Automata Theory Courses." Journal of Disruptive Learning Innovation (JODLI) 1, no. 2 (May 30, 2020): 45. http://dx.doi.org/10.17977/um072v1i22020p45-58.

Texto completo

Resumen

AbstractA proper learning process should contain innovative, amusing, challenging, and motivating aspects. It should be able to provide an opportunity for the students to develop their creativity and independence based on their interests and talent. Less interesting and tedious classroom learning activity indicates the factor of the students’ learning interest degradation, for example as in the language and automata theory and finite-state automata reduction subject. The current research aims to aid language and automata theory in a learning activity to be easier to acquire. With the Augmented

Los estilos APA, Harvard, Vancouver, ISO, etc.

46

S.KOM., SUGIYANTO, Hamdan, Eni Heni Hermaliani, Tuti Haryanti, and Windu Gata. "PENERAPAN FINITE STATE AUTOMATA PADA VENDING MACHINE SISTEM PARKIR KENDARAAN MOTOR." Jurnal Ilmiah Betrik 12, no. 2 (August 12, 2021): 146–53. http://dx.doi.org/10.36050/betrik.v12i2.324.

Texto completo

Resumen

Kebutuhan akan tempat parkir menjadi suatu hal yang penting bilamana area untuk parkir tidak ada atau lahan yang semakin sempit. Tentu perlu dipikirkan alternatif yang modern dan kekinian untuk menciptakan sebuah kondisi tempat parkir yang nyaman. Penciptaan sebuah tempat parkir yang nyaman dengan menggunakan kombinasi teknologi akan sangat membantu bilamana hal ini bisa di aplikasikan. Tujuan penelitian ini membahas penerapan Finite State Automata (FSA) pada vending machine sistem parkir kendaraan motor. Metode penelitian dengan melakukan penggambaran Finite State Automata menggunakan Non-det

Los estilos APA, Harvard, Vancouver, ISO, etc.

47

van, Zijl Lynette, and Jaco Geldenhuys. "Descriptional Complexity of Ambiguity in Symmetric Difference NFAs." JUCS - Journal of Universal Computer Science 17, no. (6) (March 28, 2011): 874–90. https://doi.org/10.3217/jucs-017-06-0874.

Texto completo

Resumen

We investigate ambiguity for symmetric difference nondeterministic finite automata. We show the existence of unambiguous, finitely ambiguous, polynomially ambiguous and exponentially ambiguous symmetric difference nondeterministic finite automata. We show that, for each of these classes, there is a family of n-state nondeterministic finite automata such that the smallest equivalent deterministic finite automata have O(2n) states.

Los estilos APA, Harvard, Vancouver, ISO, etc.

48

Riduan Achmad, Refi, Fahmi Fadillah Septiana, Nur Syamsi, Bobby Suryo Prakoso, and Hafifah Bella Novitasari. "Penerapan Finite State Automata pada Vending Machine dalam Melakukan Transaksi Pengembalian Buku di Perpustakaan." METIK JURNAL 5, no. 1 (June 24, 2021): 63–70. http://dx.doi.org/10.47002/metik.v5i1.219.

Texto completo

Resumen

Revolusi Industri 4.0 dan Society 5.0 menuntut untuk terus mengembangkan bidang teknologi dan sumber daya manusia dalam seluruh ranah kehidupan. Penelitian ini bertujuan untuk memadukan antara teknologi dan upaya peningkatan literasi, dalam hal ini membahas tentang penerapan finite automata pada vending machine untuk mempermudah transaksi pengembalian buku di perpustakaan. Metode penelitian yakni melakukan penggambaran Finite State Automata menggunakan Non-deterministic Finite Automata, perancangan Diagram State mengenai fitur-fitur dan desain tampilan antarmuka saat Vending Machine diimplemen

Los estilos APA, Harvard, Vancouver, ISO, etc.

49

Rauch, Christian, and Markus Holzer. "On the accepting state complexity of operations on permutation automata." RAIRO - Theoretical Informatics and Applications 57 (2023): 9. http://dx.doi.org/10.1051/ita/2023010.

Texto completo

Resumen

We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations on languages accepted by permutation automata: union, quotient, complement, difference, intersection, Kleene star, Kleene plus, and reversal. The paper thus joins the study of the accepting state complexity of regularity preserving language operations which was initiated in [J. Dassow, J. Autom., Lang. Comb. 21 (2016) 55–67]. We show that for almost all of the above-mentioned operations, except for reversal and quotient, there is no differenc

Los estilos APA, Harvard, Vancouver, ISO, etc.

50

Tachon, Thibaut, Chong Li, Gaétan Hains, and Frédéric Loulergue. "Automated Generation of BSP Automata." Parallel Processing Letters 27, no. 01 (March 2017): 1740002. http://dx.doi.org/10.1142/s0129626417400023.

Texto completo

Resumen

Bulk-Synchronous Parallel (BSP) is a bridging model between abstract execution and concrete parallel architectures that retains enough information to model performance scalability. In order to model BSP program executions, Hains adapted the theory of finite automata to the BSP paradigm by introducing BSP automata [12]. In the initial description of the theory, BSP automata had to be explicitly defined as structured sets of states and transitions. The lack of a clean and efficient algorithm for generating them from regular expressions would have prevented this theory from being used in practice

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!