Accedi

Bibliografie tematiche / Finite state automata / Articoli di riviste

Segui questo link per vedere altri tipi di pubblicazioni sul tema: Finite state automata.

Articoli di riviste sul tema "Finite state automata"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 9 giugno 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Finite state automata".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.

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.

Testo completo

Abstract (sommario):

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 construction of the canonical RFSA similar to the subset construction used to build the minimal DFA from a given NFA. We study the size of canonical RFSAs and the complexity of our constructions.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 probability distribution it represents. The derivational entropy in a finite-state automaton is computed from the probability that is accumulated in all of its individual state sequences. The computation of the entropy from a weighted finite-state automaton requires a normalized model. This article studies an efficient computation of the derivational entropy of left-to-right probabilistic finite-state automata, and it introduces an efficient algorithm for normalizing weighted finite-state automata. The efficient computation of the derivational entropy is also extended to continuous hidden Markov models.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 theory itself is how to make machines works automatically. Therefore, this study aims to show the implementation the concept of Automata theory in an amusement park automatic ticket selling machine.  Methods: The method used to develop the application is formal methods known as Finite State Automata. Formal method is a mathematical modelling that links the production, development, and verification of software and hardware. In this application, the concept of Finite State Automata was applied to recognize and then capture the pattern on the process of ticket selling machine.  Results: The result of this study shows that Finite State Automata can become one of the alternatives to design an automatic ticket selling machine for an amusement park by reading each input given by the user and then converts it to the language know by the Finite State Automata.  Discussion: In this application, the payment method is by inserting a certain amount of cash into the machine and the machine will proceed to the next process. However, for future development another payment method can be added. For example, instead of inserting cash, user can choose to pay using debit as well as credit card.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 automata, defined by the set of operations they are allowed to apply, are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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, the concept of fuzzy topology on general fuzzy finite switchboard automata in terms of these characterisations is formulated.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 removed from the language it accepts; both operations are very important when dictionary maintenance is performed and solve the dictionary construction problem addressed by Daciuk et al. as a special case. The algorithms proposed here may be straightforwardly derived from the customary textbook constructions for the intersection and the complementation of finite-state automata; the algorithms exploit the special properties of the automata resulting from the intersection operation when one of the finite-state automata accepts a single string.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 machine ini akan menggunakan metode finite state automata (FSA). Dengan desain finite state automata, penelitian ini telah menghasilkan desain vending machine logam mulia berbasis Internet of Things (IoT) dari cara login ke vending machine sampai fisik logam mulia dapat diterima. Produk penjualan logam mulia dengan menggunakan vending machine ini diharapkan dapat menjangkau masyarakat lebih luas untuk berinvestasi, khususnya logam mulia.  Kata kunci: Internet of Things, logam mulia, vending machine   Abstract: Saving gold is an investment that is considered a safe haven, in the midst of today's modern era saving gold can be done in installments, while the problem is the concern when the physical gold cannot be physically withdrawn which creates the potential for fraud or fraudulent investments that are currently rampant. to overcome this problem the sale of precious metals can be developed to be more attractive with vending machines, to deepen understanding of one of the fundamental computing models and the introduction of the Internet of Things (IoT), this vending machine design will use the finite state automata (FSA) method. With the design of finite state automata (FSA), this research has resulted in the design of a gold vending machine based on the Internet of Things (IoT) from how to login to the vending machine until the gold is physically acceptable. The product selling gold using vending machines is expected to reach a wider audience to invest, especially gold.  Keywords: Internet of Things, precious metals, vending machine

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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. The result of this research is a design of an automatic clothes-folding that can be implemented properly and correctly for UNHAN RI’s students. This automatic clothes-folding has succeeded to create consistent folds even though user tried with different clothes.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 the case of deterministic 1-limited automata. This also implies an exponential state gap between nondeterministic and deterministic 1-limited automata. Another consequence is that 1-limited automata can have less states than equivalent two-way nondeterministic finite automata. We show that this is true even if we restrict to the case of the one-letter input alphabet. For each d ≥ 2, d-limited automata are known to characterize the class of context-free languages. Using the Chomsky-Schützenberger representation for contextfree languages, we present a new conversion from context-free languages into 2-limited automata.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 Permata Sapphire Alami sehingga didapatkan sistem penjualan batu permata pada masa depan secara efektif dan nyaman. Dalam Vending machine Batu Permata Sapphire Alami menggunakan Finite State Automata dilengkapi dengan satu metode pembayaran yaitu menggunakan uang tunai. Perancangan Vending machine Batu Permata Sapphire Alami menggunakan Finite State Automata diharapkan dapat diterapkan dan dikembangkan di sentra – sentra penjualan oleh – oleh yang menjual batu – batu permata sehingga dapat dinikmati oleh masyarakat luas.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 we investigate a related concept of stability, using techniques of linear algebra. We have proved in our earlier papers that the road coloring conjecture is equivalent to the conjecture that each strongly connected and aperiodic graph has a coloring where at least one pair of states is stable. In the present work we prove that stable pairs of states exist in all automata that are almost balanced in the sense that there is at most one state for each color where synchronization can take place. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.

Gli stili APA, Harvard, Vancouver, ISO e altri

27

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

Testo completo

Abstract (sommario):

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 computational complexity, the state complexity of these representations compared with other representations of the same language, and the bounds for state complexity in case we perform a representation transformation. Minimization for both models proves to be NP-hard. A method is presented to transform minimization algorithms for deterministic automata into simplification algorithms applicable to these extended models. DFCAs with “do not care” symbols prove to have comparable state complexity as Nondeterministic Finite Cover Automata. Furthermore, for multiple entry DFCAs, we can have a tight estimate of the state complexity of the transformation into equivalent DFCA.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 less number of states is discussed.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is relevant at each intermediate step; it tends to be lost when intervening elements do not depend on it. At first glance this may suggest that such networks are not relevant to natural language, in which dependencies may span indefinite distances. However, embeddings in natural language are not completely independent of earlier information. The final simulation shows that long distance sequential contingencies can be encoded by the network even if only subtle statistical properties of embedded strings depend on the early information.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 Reality-based learning media, the researcher hopes that the students can develop their understanding and their interest in a learning activity, especially for finite-state automata subjects. The subject of the current research is the Augmented Reality-based application as the learning media for language and automata theory and finite-state automata material. The researcher employs several research methodologies such as literature review, library research, and questionnaire to support the current research. The application is designed according to system development that consists of problem identification, appropriateness study, need analysis, concept designing, content designing, script designing, graphic designing, system production, and system examination. The result of the current research is the AR-based learning media application for the finite-state automata reduction subject of language and automata theory. Keywords: Learning Media, Finite-State Automata Reduction, Augmented Reality

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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-deterministic Finite Automata, perancangan Diagram State tentang fitur-fitur dan desain antarmuka saat Vending Machine diimplementasikan. Hasil penelitian menunjukkan penggunaan Non-deterministic Finite Automata pada desain Vending Machine sistem parkir kendaraan motor didapatkan teknologi parkir masa depan yang modern nyaman dan efektif.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 diimplementasikan. Hasil penelitian menunjukkan bahwa penggunaan Non-deterministic Finite Automata pada desain Vending Machine pengembalian buku di perpustakaan dapat mempermudah transaksi pengembalian buku di perpustakaan.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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 difference in the accepting state complexity for permutation automata compared to deterministic finite automata in general. For both reversal and quotient we prove that certain accepting state complexities cannot be obtained; these numbers are called “magic” in the literature. Moreover, we solve the left open accepting state complexity problem for the intersection of unary languages accepted by permutation automata and deterministic finite automata in general.

Gli stili APA, Harvard, Vancouver, ISO e altri

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.

Testo completo

Abstract (sommario):

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. To alleviate this problem we introduce in this paper an algorithm that generates a BSP automaton recognizing a BSP language defined by a BSP regular expression. The main practical use of BSP automata developed in this paper is the parallelization of finite state automata with an explicit distribution and a performance model, that enable parallel matching of regular expressions. Secondarily, BSP regular expressions provide a convenient structure for automatic code generation of imperative BSP programs that is also developed in this paper.

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!