Log in

Relevant bibliographies by topics / Finite state automata

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Finite state automata'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Finite state automata.'

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

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

Journal articles on the topic "Finite state automata"

1

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

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 (2018): 17–37. http://dx.doi.org/10.1162/coli_a_00306.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

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 (2019): 1776–85. http://dx.doi.org/10.35974/isc.v7i1.1979.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

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 (2010): 21996–2001. http://dx.doi.org/10.1073/pnas.1015858107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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)<br>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)<br>Made

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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 too

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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 i

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

Master of Science<br>Department of Computing and Information Sciences<br>Torben Amtoft<br>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 slicin

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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 app

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Finite state automata"

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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-

APA, Harvard, Vancouver, ISO, and other styles

7

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Finite state automata"

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chapman, Joss, Markus Holzer, and Petra Wolf. "On Switching Finite State Automata." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-81202-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Finite state automata"

1

Chen, Keru, Shaowen Miao, Aiwen Lai, Ji Ma, and Sihan Chen. "Decidability of Probabilistic Current-State Opacity for Probabilistic Finite Automata." In 2024 43rd Chinese Control Conference (CCC). IEEE, 2024. http://dx.doi.org/10.23919/ccc63176.2024.10661575.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ron, Dana, and Ronitt Rubinfeld. "Learning fallible finite state automata." In the sixth annual conference. ACM Press, 1993. http://dx.doi.org/10.1145/168304.168336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ranhel, Joao. "Neural Assemblies and Finite State Automata." In 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Finite state automata"

1

Borgwardt, Stefan, and 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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

Borgwardt, Stefan, and 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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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 au

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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-c

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!