Bibliografías temáticas / Finite state automata

Literatura académica sobre el tema "Finite state automata"

Autor: Grafiati
Publicado: 4 de junio de 2021
Última modificación: 8 de junio de 2024

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

Elija tipo de fuente:

Índice

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas 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.

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

1

Sánchez, Joan Andreu, Martha Alicia Rocha, Verónica Romero y Mauricio Villegas. "On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models". Computational Linguistics 44, n.º 1 (marzo de 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 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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Praba, B. y R. Saranya. "Non Homogeneous Rough Finite State Automaton". Revista Gestão Inovação e Tecnologias 11, n.º 2 (5 de junio de 2021): 629–41. http://dx.doi.org/10.47059/revistageintec.v11i2.1700.

Texto completo
Resumen
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’.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Carrasco, Rafael C. y Mikel L. Forcada. "Incremental Construction and Maintenance of Minimal Finite-State Automata". Computational Linguistics 28, n.º 2 (junio de 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 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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Kavikumar, J., S. P. Tiwari, Nur Ain Ebas y A. H. Nor Shamsidah. "General Fuzzy Finite Switchboard Automata". New Mathematics and Natural Computation 15, n.º 02 (20 de junio de 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, the concept of fuzzy topology on general fuzzy finite switchboard automata in terms of these characterisations is formulated.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

SALOMAA, KAI y PAUL SCHOFIELD. "STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA". International Journal of Foundations of Computer Science 18, n.º 06 (diciembre de 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.
7

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Kaunang, Fergie Joanda y Jacquline Waworundeng. "Implementation of Finite State Automata in an Amusement Park Automatic Ticket Selling Machine". Abstract Proceedings International Scholars Conference 7, n.º 1 (18 de diciembre de 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 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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Kaur, Ranjeet y Alka Tripathi. "State Minimization of General Finite Fuzzy Automata". International Journal of Mathematical, Engineering and Management Sciences 6, n.º 6 (1 de diciembre de 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 less number of states is discussed.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Resumen
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 com­plexity) 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 em­pirical experience of accumulated malicious traffic in intrusion detection systems.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Tesis sobre el tema "Finite state automata"

1

Merryman, William Patrick. "Animating the conversion of nondeterministic finite state automata to deterministic finite state automata". Thesis, Montana State University, 2007. http://etd.lib.montana.edu/etd/2007/merryman/MerrymanW0507.pdf.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

FRANCH, Daniel Kudlowiez. "Dynamical system modeling with probabilistic finite state automata". Universidade Federal de Pernambuco, 2017. https://repositorio.ufpe.br/handle/123456789/25448.

Texto completo
Resumen
Submitted by Fernanda Rodrigues de Lima (fernanda.rlima@ufpe.br) on 2018-08-02T22:51:47Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Daniel Kudlowiez Franch.pdf: 1140156 bytes, checksum: c02b1b4ca33f8165be5960ba5a212730 (MD5)
Approved for entry into archive by Alice Araujo (alice.caraujo@ufpe.br) on 2018-08-07T21:11:31Z (GMT) No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Daniel Kudlowiez Franch.pdf: 1140156 bytes, checksum: c02b1b4ca33f8165be5960ba5a212730 (MD5)
Made available in DSpace on 2018-08-07T21:11:31Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Daniel Kudlowiez Franch.pdf: 1140156 bytes, checksum: c02b1b4ca33f8165be5960ba5a212730 (MD5) Previous issue date: 2017-03-10
FACEPE
Discrete dynamical systems are widely used in a variety of scientific and engineering applications, such as electrical circuits, machine learning, meteorology and neurobiology. Modeling these systems involves performing statistical analysis of the system output to estimate the parameters of a model so it can behave similarly to the original system. These models can be used for simulation, performance analysis, fault detection, among other applications. The current work presents two new algorithms to model discrete dynamical systems from two categories (synchronizable and non-synchronizable) using Probabilistic Finite State Automata (PFSA) by analyzing discrete symbolic sequences generated by the original system and applying statistical methods and inference, machine learning algorithms and graph minimization techniques to obtain compact, precise and efficient PFSA models. Their performance and time complexity are compared with other algorithms present in literature that aim to achieve the same goal by applying the algorithms to a series of common examples.
Sistemas dinâmicos discretos são amplamente usados em uma variedade de aplicações cientifícas e de engenharia, por exemplo, circuitos elétricos, aprendizado de máquina, meteorologia e neurobiologia. O modelamento destes sistemas envolve realizar uma análise estatística de sequências de saída do sistema para estimar parâmetros de um modelo para que este se comporte de maneira similar ao sistema original. Esses modelos podem ser usados para simulação, referência ou detecção de falhas. Este trabalho apresenta dois novos algoritmos para modelar sistemas dinâmicos discretos de duas categorias (sincronizáveis e não-sincronizáveis) por meio de Autômatos Finitos Probabilísticos (PFSA, Probabilistic Finite State Automata) analisando sequências geradas pelo sistema original e aplicando métodos estatísticos, algoritmos de aprendizado de máquina e técnicas de minimização de grafos para obter modelos PFSA compactos e eficientes. Sua performance e complexidade temporal são comparadas com algoritmos presentes na literatura que buscam atingir o mesmo objetivo aplicando os algoritmos a uma série de exemplos.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Khemuka, Atul Ravi. "Workflow Modeling Using Finite Automata". [Tampa, Fla.] : University of South Florida, 2003. http://purl.fcla.edu/fcla/etd/SFE0000172.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Bird, Philip. "Unifying programming paradigms : logic programming and finite state automata". Thesis, University of Sheffield, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.419609.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Egri-Nagy, Attila. "Algebraic hierarchical decomposition of finite state automata : a computational approach". Thesis, University of Hertfordshire, 2005. http://hdl.handle.net/2299/14267.

Texto completo
Resumen
The theory of algebraic hierarchical decomposition of finite state automata is an important and well developed branch of theoretical computer science (Krohn-Rhodes Theory). Beyond this it gives a general model for some important aspects of our cognitive capabilities and also provides possible means for constructing artificial cognitive systems: a Krohn-Rhodes decomposition may serve as a formal model of understanding since we comprehend the world around us in terms of hierarchical representations. In order to investigate formal models of understanding using this approach, we need efficient tools but despite the significance of the theory there has been no computational implementation until this work. Here the main aim was to open up the vast space of these decompositions by developing a computational toolkit and to make the initial steps of the exploration. Two different decomposition methods were implemented: the VuT and the holonomy decomposition. Since the holonomy method, unlike the VUT method, gives decompositions of reasonable lengths, it was chosen for a more detailed study. In studying the holonomy decomposition our main focus is to develop techniques which enable us to calculate the decompositions efficiently, since eventually we would like to apply the decompositions for real-world problems. As the most crucial part is finding the the group components we present several different ways for solving this problem. Then we investigate actual decompositions generated by the holonomy method: automata with some spatial structure illustrating the core structure of the holonomy decomposition, cases for showing interesting properties of the decomposition (length of the decomposition, number of states of a component), and the decomposition of finite residue class rings of integers modulo n. Finally we analyse the applicability of the holonomy decompositions as formal theories of understanding, and delineate the directions for further research.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Cazalis, Daniel S. "Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications". FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/8.

Texto completo
Resumen
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA's behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Makarov, Alexander. "Application of finite state methods to shape coding and processing in object-based video". Thesis, Staffordshire University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368316.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Atchuta, Kaushik. "Slicing of extended finite state machines". Kansas State University, 2014. http://hdl.handle.net/2097/17640.

Texto completo
Resumen
Master of Science
Department of Computing and Information Sciences
Torben Amtoft
An EFSM (Extended Finite State Machine) is a tuple (S, T, E, V) where S is a finite set of states, T is a finite set of transitions, E is a finite set of events, and V is a finite set of variables. Every transition t in T has a source state and a target state, both in S. There is a need to develop a GUI which aids in building such machines and simulating them so that a slicing algorithm can be implemented on such graphs. This was the main idea of Dr. Torben Amtoft, who has actually written the slicing algorithm and wanted this to be implemented in code. The project aims at implementing a GUI which is effective to simulate and build the graph with minimum user effort. Poor design often fails to attract users. So, the initial effort is to build a simple and effective GUI which serves the purpose of taking input from the user, building graphs and simulating it. The scope of this project is to build and implement an interface so that the users can do the following in an effective way:  Input a specification of an EFSM  Store and later retrieve EFSMs  Displaying an EFSM in a graphical form  Simulating the EFSM  Modify an EFSM  Implement the slicing algorithm All the above mentioned features must be integrated into the GUI and it should only fail if the input specification is wrong.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Wilson, Deborah Ann Stoffer. "A Study of the Behavior of Chaos Automata". Kent State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=kent1478955376070686.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Hulden, Mans. "Finite-state Machine Construction Methods and Algorithms for Phonology and Morphology". Diss., The University of Arizona, 2009. http://hdl.handle.net/10150/196112.

Texto completo
Resumen
This dissertation is concerned with finite state machine-based technology for modeling natural language. Finite-state machines have proven to be efficient computational devices in modeling natural language phenomena in morphology and phonology. Because of their mathematical closure properties, finite-state machines can be manipulated and combined in many flexible ways that closely resemble formalisms used in different areas of linguistics to describe natural language. The use of finite-state transducers in constructing natural language parsers and generators has proven to be a versatile approach to describing phonological alternation, morphological constraints and morphotactics, and syntactic phenomena on the phrase level.The main contributions of this dissertation are the development of a new model of multitape automata, the development of a new logic formalism that can substitute for regular expressions in constructing complex automata, and adaptations of these techniques to solving classical construction problems relating to finite-state transducers, such as modeling reduplication and complex phonological replacement rules.The multitape model presented here goes hand-in-hand with the logic formalism, the latter being a necessary step to constructing the former. These multitape automata can then be used to create entire morphological and phonological grammars, and can also serve as a neutral intermediate tool to ease the construction of automata for other purposes.The construction of large-scale finite-state models for natural language grammars is a very delicate process. Making any solution practicable requires great care in the efficient implementation of low-level tasks such as converting regular expressions, logical statements, sets of constraints, and replacement rules to automata or finite transducers. To support the overall endeavor of showing the practicability of the logical and multitape extensions proposed in this thesis, a detailed treatment of efficient implementation of finite-state construction algorithms for natural language purposes is also presented.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Libros sobre el tema "Finite state automata"

1

Sifakis, Joseph, ed. Automatic Verification Methods for Finite State Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52148-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Ferdinand, Wagner, ed. Modeling software with finite state machines: A practical approach. Boca Raton, FL: Taylor & Francis, 2006.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Carson-Berndsen, Julie. Time Map Phonology: Finite State Models and Event Logics in Speech Recognition. Dordrecht: Springer Netherlands, 1998.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Time map phonology: Finite state models and event logics in speech recognition. Dordrecht: Kluwer, 1998.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Schulz, Klaus U. y Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Schulz, Klaus U. y Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Karttunen, Lauri. Finite-State Technology. Editado por Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0018.

Texto completo
Resumen
The article introduces the basic concepts of finite-state language processing: regular languages and relations, finite-state automata, and regular expressions. Many basic steps in language processing, ranging from tokenization, to phonological and morphological analysis, disambiguation, spelling correction, and shallow parsing, can be performed efficiently by means of finite-state transducers. The article discusses examples of finite-state languages and relations. Finite-state networks can represent only a subset of all possible languages and relations; that is, only some languages are finite-state languages. Furthermore, this article introduces two types of complex regular expressions that have many linguistic applications, restriction and replacement. Finally, the article discusses the properties of finite-state automata. The three important properties of networks are: that they are epsilon free, deterministic, and minimal. If a network encodes a regular language and if it is epsilon free, deterministic, and minimal, the network is guaranteed to be the best encoding for that language.
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Aubry, Jean François y Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Aubry, Jean François y Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Aubry, Jean François y Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Capítulos de libros sobre el tema "Finite state automata"

1

Dai, Jack J., James I. Lathrop, Jack H. Lutz y Elvira Mayordomo. "Finite-State Dimension". En Automata, Languages and Programming, 1028–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_83.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Sankur, Ocan. "Timed Automata Verification and Synthesis via Finite Automata Learning". En Tools and Algorithms for the Construction and Analysis of Systems, 329–49. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_21.

Texto completo
Resumen
AbstractWe present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a large finite-state machine and a relatively smaller timed automaton, and using compositional reasoning on this composition. We use automata learning algorithms to learn finite automata approximations of the timed automaton component, in order to reduce the problem at hand to finite-state model checking or to finite-state controller synthesis. We present an experimental evaluation of our approach.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Denis, François, Aurélien Lemay y Alain Terlutte. "Residual Finite State Automata". En STACS 2001, 144–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44693-1_13.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Miszczak, Jarosław Adam. "Quantum Finite State Automata". En High Level Structures for Quantum Computing, 19–31. Cham: Springer International Publishing, 2012. http://dx.doi.org/10.1007/978-3-031-02516-7_3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Unold, Olgierd, Maciej Troć, Tadeusz Dobosz y Alicja Trusewicz. "Finite-State Molecular Computing". En Implementation and Application of Automata, 309–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45089-0_33.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Fernando, Tim. "Finite-State Temporal Projection". En Implementation and Application of Automata, 230–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11812128_22.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Culik, Karel y Jarkko Kari. "Finite state transformations of images". En Automata, Languages and Programming, 51–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_62.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Zhang, Kuize, Lijun Zhang y Lihua Xie. "Detectability of Finite-State Automata". En Discrete-Time and Discrete-Space Dynamical Systems, 179–92. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25972-3_9.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Vilares, Manuel, Juan Otero y Jorge Graña. "Regional Finite-State Error Repair". En Implementation and Application of Automata, 269–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30500-2_25.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Doty, David, Jack H. Lutz y Satyadev Nandakumar. "Finite-State Dimension and Real Arithmetic". En Automata, Languages and Programming, 537–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11786986_47.

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

Actas de conferencias sobre el tema "Finite state automata"

1

Ron, Dana y Ronitt Rubinfeld. "Learning fallible finite state automata". En the sixth annual conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/168304.168336.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Fanton, Michel. "Finite state automata and Arabic writing". En the Workshop. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/1621753.1621759.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Fulop, Endre y Norbert Pataki. "Symbolic Execution with Finite State Automata". En 2019 IEEE 15th International Scientific Conference on Informatics. IEEE, 2019. http://dx.doi.org/10.1109/informatics47936.2019.9119287.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Ranhel, Joao. "Neural Assemblies and Finite State Automata". En 2013 BRICS Congress on Computational Intelligence & 11th Brazilian Congress on Computational Intelligence (BRICS-CCI & CBIC). IEEE, 2013. http://dx.doi.org/10.1109/brics-cci-cbic.2013.16.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Pastor-i-Gadea, M. y F. Casacuberta. "Automatic learning of finite state automata for pronunciation modeling". En 7th European Conference on Speech Communication and Technology (Eurospeech 2001). ISCA: ISCA, 2001. http://dx.doi.org/10.21437/eurospeech.2001-547.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Adenis, Patrick, Kushal Mukherjee y Asok Ray. "State splitting and state merging in probabilistic finite state automata". En 2011 American Control Conference. IEEE, 2011. http://dx.doi.org/10.1109/acc.2011.5990861.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Teichmann, Christoph, Kasimir Wansing y Alexander Koller. "Adaptive Importance Sampling from Finite State Automata". En Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata. Stroudsburg, PA, USA: Association for Computational Linguistics, 2016. http://dx.doi.org/10.18653/v1/w16-2402.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

AbuSafiya, Majed. "Measuring Documents Similarity using Finite State Automata". En 2020 2nd International Conference on Mathematics and Information Technology (ICMIT). IEEE, 2020. http://dx.doi.org/10.1109/icmit47780.2020.9047016.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Bala, V. y N. Rubin. "Efficient instruction scheduling using finite state automata". En Proceedings of MICRO'95: 28th Annual IEEE/ACM International Symposium on Microarchitecture. IEEE, 1995. http://dx.doi.org/10.1109/micro.1995.476812.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Chen, Yinkai, Rui Zhang, Xin Qiu, Xin Li y Yuxin Deng. "Explaining GBDT by Probabilistic Finite-State Automata". En ICCPR '21: 2021 10th International Conference on Computing and Pattern Recognition. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3497623.3497676.

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

Informes sobre el tema "Finite state automata"

1

Borgwardt, Stefan y Rafael Peñaloza. Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version. Technische Universität Dresden, 2011. http://dx.doi.org/10.25368/2022.180.

Texto completo
Resumen
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation, and inclusion for weighted automata on infinite trees and show that they are not harder complexity-wise than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Borgwardt, Stefan y Rafael Peñaloza. Complementation and Inclusion of Weighted Automata on Infinite Trees. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.178.

Texto completo
Resumen
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Baader, Franz y Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.

Texto completo
Resumen
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behaviour is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behaviour, which at any point in time yields a finite prefix of a trace. The task is then to check whether all continuations of this prefix to a trace satisfy (violate) the formula. More precisely, one wants to construct a monitor, i.e., a finite automaton that receives the finite prefix as input and then gives the right answer based on the state currently reached. In this paper, we extend the known approaches to LTL runtime verification in two directions. First, instead of propositional LTL we use the more expressive temporal logic ALC-LTL, which can use axioms of the Description Logic (DL) ALC instead of propositional variables to describe properties of single states of the system. Second, instead of assuming that the observed system behaviour provides us with complete information about the states of the system, we assume that states are described in an incomplete way by ALC-knowledge bases. We show that also in this setting monitors can effectively be constructed. The (double-exponential) size of the constructed monitors is in fact optimal, and not higher than in the propositional case. As an auxiliary result, we show how to construct Büchi automata for ALC-LTL-formulae, which yields alternative proofs for the known upper bounds of deciding satisfiability in ALC-LTL.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Bryant, R. E., E. M. Clarke y O. Grumberg. Research on Automatic Verification of Finite-State Concurrent Systems. Fort Belvoir, VA: Defense Technical Information Center, diciembre de 1987. http://dx.doi.org/10.21236/ada188618.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Dill, David. Automatic Verification and Synthesis of Finite-State Hard Real-Time Systems. Fort Belvoir, VA: Defense Technical Information Center, mayo de 1994. http://dx.doi.org/10.21236/ada291279.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Yan, Yujie y Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, mayo de 2021. http://dx.doi.org/10.17760/d20410114.

Texto completo
Resumen
Recent advances in visual sensing technology have gained much attention in the field of bridge inspection and management. Coupled with advanced robotic systems, state-of-the-art visual sensors can be used to obtain accurate documentation of bridges without the need for any special equipment or traffic closure. The captured visual sensor data can be post-processed to gather meaningful information for the bridge structures and hence to support bridge inspection and management. However, state-of-the-practice data postprocessing approaches require substantial manual operations, which can be time-consuming and expensive. The main objective of this study is to develop methods and algorithms to automate the post-processing of the visual sensor data towards the extraction of three main categories of information: 1) object information such as object identity, shapes, and spatial relationships - a novel heuristic-based method is proposed to automate the detection and recognition of main structural elements of steel girder bridges in both terrestrial and unmanned aerial vehicle (UAV)-based laser scanning data. Domain knowledge on the geometric and topological constraints of the structural elements is modeled and utilized as heuristics to guide the search as well as to reject erroneous detection results. 2) structural damage information, such as damage locations and quantities - to support the assessment of damage associated with small deformations, an advanced crack assessment method is proposed to enable automated detection and quantification of concrete cracks in critical structural elements based on UAV-based visual sensor data. In terms of damage associated with large deformations, based on the surface normal-based method proposed in Guldur et al. (2014), a new algorithm is developed to enhance the robustness of damage assessment for structural elements with curved surfaces. 3) three-dimensional volumetric models - the object information extracted from the laser scanning data is exploited to create a complete geometric representation for each structural element. In addition, mesh generation algorithms are developed to automatically convert the geometric representations into conformal all-hexahedron finite element meshes, which can be finally assembled to create a finite element model of the entire bridge. To validate the effectiveness of the developed methods and algorithms, several field data collections have been conducted to collect both the visual sensor data and the physical measurements from experimental specimens and in-service bridges. The data were collected using both terrestrial laser scanners combined with images, and laser scanners and cameras mounted to unmanned aerial vehicles.
Los estilos APA, Harvard, Vancouver, ISO, etc.
También puede estar interesado en las bibliografías ampliadas sobre el tema "Finite state automata" para tipos de fuentes particulares:
Artículos de revistas Tesis Libros
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!

Pasar a la bibliografía