Zaloguj się

Gotowe bibliografie tematyczne / Finite state automata / Artykuły w czasopismach

Artykuły w czasopismach na temat „Finite state automata”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Finite state automata.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 8 czerwca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Finite state automata”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Praba, B., i R. Saranya. "Non Homogeneous Rough Finite State Automaton". Revista Gestão Inovação e Tecnologias 11, nr 2 (5.06.2021): 629–41. http://dx.doi.org/10.47059/revistageintec.v11i2.1700.

Pełny tekst źródła

Streszczenie:

Objective: The study of finite state automaton is an essential tool in machine learning and artificial intelligence. The class of rough finite state automaton captures the uncertainty using the rough transition map. The need to generalize this concept arises to adhere the dynamical behaviour of the system. Hence this paper focuses on defining non-homogeneous rough finite state automaton. Methodology: With the aid of Rough finite state automata we define the concept of non-homogeneous rough finite state automata. Findings: Non homogeneous Rough Finite State Automata (NRFSA) Mt is defined by a tuple (Q,Σ,δt,q0 (t),F(t)) The dynamical behaviour of any system can be expressed in terms of an information system at time t. This leads us to define non-homogeneous rough finite state automaton. For each time ‘t’ we generate lower approximation rough finite state automaton Mt_ and the upper approximation rough finite state automaton Mt- and the defined concepts are elaborated with suitable examples. The ordered pair , Mt=(M(t)-,M(t)-) is called as the non-homogeneous rough finite state automaton. Conclusion: Over all our study reveals the characterization of the system which changes its behaviour dynamically over a time ‘t’. Novelty: The novelty of the proposed article is that it clearly immense the system behaviour over a time ‘t’. Using this concept the possible and the definite transitions in the system can be calculated in any given time ‘t’.

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

10

Bernadotte, A. "Structural Modification of the Finite State Machine to Solve the Exponential Explosion Problem". Programmnaya Ingeneria 13, nr 9 (7.11.2022): 449–61. http://dx.doi.org/10.17587/prin.13.449-461.

Pełny tekst źródła

Streszczenie:

In many modern applications, such as intrusion detection and prevention systems, expert knowledge can be formalized in the form of regular expressions. After this formalization, a finite automaton checks whether a word belongs to a regular language. Deterministic finite automata have an optimal time complexity, but the number of automaton states (space complexity) can grow exponentially with the length of the regular expression. At the same time, the time complexity is the main disadvantage of non-deterministic finite automata. Therefore, reducing spatial complexity while maintaining low time complexity is highly relevant. In applied problems of regular language recognition, a significant problem is the problem of the exponentially growing number of states of the recognizing deterministic finite automaton depending on the length of regular expressions of the recognized language — the exponential explosion problem. There are the following three main approaches to solving this problem using finite automata: 1) restriction on signatures given by experts; 2) regular language modification — this approach assumes the appearance in the solution of a practical problem of recognizing errors of the first and second kind; 3) finite automata modification without recognizing regular language changing. The third approach can be implemented as a finite automata modification through compression algorithms and particular structural elements. The paper presents a review of modern solutions, the main idea of which is the transition from an abstract finite automaton, represented by a table-specified function, to a structural automaton that combines the abstract part stored in the memory and various structural elements such as bit arrays and counters. Some ideas and algorithms have become especially successful when solving the exponential explosion problem by adding special structural elements. First, such successful solutions include the use of counters. Second, the idea of storing additional information about the state machine. Third, the combination of non-deterministic and deterministic finite automata. Fourth, the economic attitude to the state machine regarding its location to fast and slow memory allows us to consider the empirical experience of accumulated malicious traffic in intrusion detection systems.

Style APA, Harvard, Vancouver, ISO itp.

11

Chigahara, Hiroyuki, Szilárd Zsolt Fazekas i Akihiro Yamamura. "One-Way Jumping Finite Automata". International Journal of Foundations of Computer Science 27, nr 03 (luty 2016): 391–405. http://dx.doi.org/10.1142/s0129054116400165.

Pełny tekst źródła

Streszczenie:

We propose the one-way jumping finite automaton model, restricting the jumping relation of the recently introduced jumping finite automaton so that the machine can only jump over symbols it cannot process in its current state. The reading head of a one-way jumping finite automaton moves deterministically in one direction within the input word, whereas movement of the reading head of jumping finite automaton is non-deterministic. The class of languages accepted by one-way jumping finite automata is different from that of jumping finite automata, in particular, it includes all regular languages, as opposed to the latter. We study one-way jumping finite automata and obtain closure properties, a pumping lemma, and separation results with respect to the classical language classes of the Chomsky hierarchy.

Style APA, Harvard, Vancouver, ISO itp.

12

ADAMATZKY, ANDREW. "ON OSCILLATORS IN PHYLLOSILICATE EXCITABLE AUTOMATA". International Journal of Modern Physics C 24, nr 06 (maj 2013): 1350034. http://dx.doi.org/10.1142/s0129183113500344.

Pełny tekst źródła

Streszczenie:

Phyllosilicate is a sheet of silicate tetrahedra bound by basal oxygens. A phyllosilicate excitable automaton is a regular network of finite state machines, which mimics structure of a silicate sheet. A node of the silicate sheet is an automaton, which takes resting, excited and refractory states, and updates its state in discrete time depending on a sum of excited states of its three (silicon automata) or six (oxygen automata) closest neighbors. Oscillator is a localized compact configuration of nonquiescent states which undergoes finite growth and modification but returns to its original state in a finite number of steps. We show that phyllosilicate excitable automata exhibit waves and oscillating localizations (oscillators) dynamics. Basic types of oscillators are classified and characterized.

Style APA, Harvard, Vancouver, ISO itp.

13

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

PIGHIZZINI, GIOVANNI. "DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES". International Journal of Foundations of Computer Science 20, nr 04 (sierpień 2009): 629–45. http://dx.doi.org/10.1142/s0129054109006784.

Pełny tekst źródła

Streszczenie:

The simulation of deterministic pushdown automata defined over a one-letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a number of states that is exponential in s. We prove that this simulation is tight. Furthermore, its cost cannot be reduced even if it is performed by a two-way nondeterministic automaton. We also prove that there are unary languages for which deterministic pushdown automata cannot be exponentially more succinct than finite automata. In order to state this result, we investigate the conversion of deterministic pushdown automata into context-free grammars. We prove that in the unary case the number of variables in the resulting grammar is strictly smaller than the number of variables needed in the case of nonunary alphabets.

Style APA, Harvard, Vancouver, ISO itp.

15

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Daciuk, Jan, Stoyan Mihov, Bruce W. Watson i Richard E. Watson. "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics 26, nr 1 (marzec 2000): 3–16. http://dx.doi.org/10.1162/089120100561601.

Pełny tekst źródła

Streszczenie:

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings. Our method is fast and significantly lowers memory requirements in comparison to other methods.

Style APA, Harvard, Vancouver, ISO itp.

17

Beier, Simon, Markus Holzer i Martin Kutrib. "Operational State Complexity and Decidability of Jumping Finite Automata". International Journal of Foundations of Computer Science 30, nr 01 (styczeń 2019): 5–27. http://dx.doi.org/10.1142/s012905411940001x.

Pełny tekst źródła

Streszczenie:

We consider jumping finite automata and their operational state complexity and decidability status. Roughly speaking, a jumping automaton is a finite automaton with a non-continuous input. This device has nice relations to semilinear sets and thus to Parikh images of regular sets, which will be exhaustively used in our proofs. In particular, we prove upper bounds on the intersection and complementation. The latter result on the complementation upper bound answers an open problem from [G. J. Lavado, G. Pighizzini, S. Seki: Operational State Complexity of Parikh Equivalence, 2014]. Moreover, we correct an erroneous result on the inverse homomorphism closure. Finally, we also consider the decidability status of standard problems as regularity, disjointness, universality, inclusion, etc. for jumping finite automata.

Style APA, Harvard, Vancouver, ISO itp.

18

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

VAN ZIJL, LYNETTE. "MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS". International Journal of Foundations of Computer Science 16, nr 05 (październik 2005): 1027–38. http://dx.doi.org/10.1142/s0129054105003455.

Pełny tekst źródła

Streszczenie:

Iwama et al. showed that there exists an n-state binary nondeterministic finite automaton such that its equivalent minimal deterministic finite automaton has exactly 2n - α states, for all n ≥ 7 and 5 ≤ α ≤ 2n-2, subject to certain coprimality conditions. We investigate the same question for both unary and binary symmetric difference nondeterministic finite automata. In the binary case, we show that for any n ≥ 4, there is an n-state symmetric difference nondeterministic finite automaton for which the equivalent minimal deterministic finite automaton has 2n - 1 + 2k - 1 - 1 states, for 2 < k ≤ n - 1. In the unary case, we consider a large practical subclass of unary symmetric difference nondeterministic finite automata: for all n ≥ 2, we argue that there are many values of α such that there is no n-state unary symmetric difference nondeterministic finite automaton with an equivalent minimal deterministic finite automaton with 2n - α states, where 0 < α < 2n - 1. For each n ≥ 2, we quantify such values of α precisely.

Style APA, Harvard, Vancouver, ISO itp.

26

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

27

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

28

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

29

ÉSIK, ZOLTÁN. "Equational axioms associated with finite automata for fixed point operations in cartesian categories". Mathematical Structures in Computer Science 27, nr 1 (8.04.2015): 54–69. http://dx.doi.org/10.1017/s0960129515000031.

Pełny tekst źródła

Streszczenie:

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and identities associated with finite automata. We show that the Conway identities and the identities associated with the members of a subclass $\mathcal{Q}$ of finite automata is complete for iteration categories iff for every finite simple group G there is an automaton Q ∈ $\mathcal{Q}$ such that G is a quotient of a group in the monoid M(Q) of the automaton Q. We also prove a stronger result that concerns identities associated with finite automata with a distinguished initial state.

Style APA, Harvard, Vancouver, ISO itp.

30

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Lapin, Eduard S., i Marat I. Abdrakhmanov. "Functional approach to deterministic finite-state automata systems dynamic modeling". Izvestiya vysshikh uchebnykh zavedenii. Gornyi zhurnal 1 (30.03.2021): 113–22. http://dx.doi.org/10.21440/0536-1028-2021-2-113-122.

Pełny tekst źródła

Streszczenie:

Research aim is to study the functional approach to modeling the deterministic finite-state automata system which is not confined to the elements communication topology and the heterogeneity of the algorithm types. Relevance. The substantial part of engineering systems applied in the mining industry may be described through the finite-state automaton model. They include the mine conveyor systems, shaft signal systems, processing facilities control systems, etc. Such model makes it possible to shorten the time spent on control software development and carry out algorithm analysis, debug, and testing effectively. There are a lot of effective approaches and tools to solve the problem of finite-state automata dynamic modeling, each of which has its own advantages and disadvantages. Methodology. In this article, the methodology of finite-state automata systems modeling is considered as applied to mine conveyor systems. Results. Final-state automata (FSA) models have been developed together with the conditions for FSA systems dynamic modeling as applied to mine conveyor systems. Conclusions. The considered approach to modeling, which involves functors and applicative functors 122 "Izvestiya vysshikh uchebnykh zavedenii. Gornyi zhurnal". No. 2. 2021 ISSN 0536-1028 for structure composition and its operational dynamics study, as well as the possibility to mathematically prove the model’s properties, makes the approach a good alternative when choosing tools for systems models development.

Style APA, Harvard, Vancouver, ISO itp.

32

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

33

Adamatzky, Andrew. "On Binary-State Phyllosilicate Automata". International Journal of Bifurcation and Chaos 25, nr 03 (marzec 2015): 1550035. http://dx.doi.org/10.1142/s0218127415500352.

Pełny tekst źródła

Streszczenie:

Phyllosilicate is a sheet of silicate tetrahedra bound by basal oxygens. A phyllosilicate automaton is a regular network of finite state machines, which mimics the structure of phyllosilicate. A node of a binary state phyllosilicate automaton takes states 0 and 1. A node updates its state in discrete time depending on a sum of states of its three (silicon nodes) or six (oxygen nodes) closest neighbors. We phenomenologically select the main types of patterns generated by phyllosilicate automata based on their shape: convex and concave hulls, almost circularly growing patterns, octagonal patterns, and those with dendritic growth; and, the patterns' interior: disordered, solid, labyrinthine. We also present the rules exhibiting traveling localizations.

Style APA, Harvard, Vancouver, ISO itp.

34

KUTRIB, MARTIN, ANDREAS MALCHER i MATTHIAS WENDLANDT. "SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA". International Journal of Foundations of Computer Science 25, nr 07 (listopad 2014): 877–96. http://dx.doi.org/10.1142/s0129054114400139.

Pełny tekst źródła

Streszczenie:

We investigate the descriptional complexity of deterministic one-way multi-head finite automata accepting unary languages. It is known that in this case the languages accepted are regular. Thus, we study the increase of the number of states when an n-state k-head finite automaton is simulated by a classical (one-head) deterministic or nondeterministic finite automaton. In the former case upper and lower bounds that are tight in the order of magnitude are shown. For the latter case we obtain an upper bound of O(n2k) and a lower bound of Ω(nk) states. We investigate also the costs for the conversion of one-head nondeterministic finite automata to deterministic k-head finite automata, that is, we trade nondeterminism for heads. In addition, we study how the conversion costs vary in the special case of finite and, in particular, of singleton unary lanuages. Finally, as an application of the simulation results, we show that decidability problems for unary deterministic k-head finite automata such as emptiness or equivalence are LOGSPACE-complete.

Style APA, Harvard, Vancouver, ISO itp.

35

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

41

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!