Добірка наукової літератури з теми "Finite state automata"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Finite state automata".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Finite state automata"
Sánchez, Joan Andreu, Martha Alicia Rocha, Verónica Romero, and Mauricio Villegas. "On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models." Computational Linguistics 44, no. 1 (March 2018): 17–37. http://dx.doi.org/10.1162/coli_a_00306.
Повний текст джерелаBASU, SUMITA. "ROUGH FINITE-STATE AUTOMATA." Cybernetics and Systems 36, no. 2 (January 18, 2005): 107–24. http://dx.doi.org/10.1080/01969720590887324.
Повний текст джерелаPraba, B., and R. Saranya. "Non Homogeneous Rough Finite State Automaton." Revista Gestão Inovação e Tecnologias 11, no. 2 (June 5, 2021): 629–41. http://dx.doi.org/10.47059/revistageintec.v11i2.1700.
Повний текст джерелаCarrasco, Rafael C., and Mikel L. Forcada. "Incremental Construction and Maintenance of Minimal Finite-State Automata." Computational Linguistics 28, no. 2 (June 2002): 207–16. http://dx.doi.org/10.1162/089120102760173652.
Повний текст джерелаKavikumar, J., S. P. Tiwari, Nur Ain Ebas, and A. H. Nor Shamsidah. "General Fuzzy Finite Switchboard Automata." New Mathematics and Natural Computation 15, no. 02 (June 20, 2019): 283–305. http://dx.doi.org/10.1142/s1793005719500157.
Повний текст джерелаSALOMAA, KAI, and PAUL SCHOFIELD. "STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA." International Journal of Foundations of Computer Science 18, no. 06 (December 2007): 1407–16. http://dx.doi.org/10.1142/s0129054107005443.
Повний текст джерелаAlawida, Moatsum, Azman Samsudin, Je Sen Teh, and Wafa’ Hamdan Alshoura. "Deterministic chaotic finite-state automata." Nonlinear Dynamics 98, no. 3 (October 25, 2019): 2403–21. http://dx.doi.org/10.1007/s11071-019-05311-z.
Повний текст джерелаKaunang, Fergie Joanda, and Jacquline Waworundeng. "Implementation of Finite State Automata in an Amusement Park Automatic Ticket Selling Machine." Abstract Proceedings International Scholars Conference 7, no. 1 (December 18, 2019): 1776–85. http://dx.doi.org/10.35974/isc.v7i1.1979.
Повний текст джерелаKaur, Ranjeet, and Alka Tripathi. "State Minimization of General Finite Fuzzy Automata." International Journal of Mathematical, Engineering and Management Sciences 6, no. 6 (December 1, 2021): 1709–28. http://dx.doi.org/10.33889/ijmems.2021.6.6.101.
Повний текст джерелаBernadotte, A. "Structural Modification of the Finite State Machine to Solve the Exponential Explosion Problem." Programmnaya Ingeneria 13, no. 9 (November 7, 2022): 449–61. http://dx.doi.org/10.17587/prin.13.449-461.
Повний текст джерелаДисертації з теми "Finite state automata"
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.
Повний текст джерелаFRANCH, Daniel Kudlowiez. "Dynamical system modeling with probabilistic finite state automata." Universidade Federal de Pernambuco, 2017. https://repositorio.ufpe.br/handle/123456789/25448.
Повний текст джерела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.
Khemuka, Atul Ravi. "Workflow Modeling Using Finite Automata." [Tampa, Fla.] : University of South Florida, 2003. http://purl.fcla.edu/fcla/etd/SFE0000172.
Повний текст джерела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.
Повний текст джерелаEgri-Nagy, Attila. "Algebraic hierarchical decomposition of finite state automata : a computational approach." Thesis, University of Hertfordshire, 2005. http://hdl.handle.net/2299/14267.
Повний текст джерелаCazalis, Daniel S. "Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications." FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/8.
Повний текст джерела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.
Повний текст джерелаAtchuta, Kaushik. "Slicing of extended finite state machines." Kansas State University, 2014. http://hdl.handle.net/2097/17640.
Повний текст джерела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.
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.
Повний текст джерела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.
Повний текст джерелаКниги з теми "Finite state automata"
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.
Повний текст джерелаFerdinand, Wagner, ed. Modeling software with finite state machines: A practical approach. Boca Raton, FL: Taylor & Francis, 2006.
Знайти повний текст джерелаCarson-Berndsen, Julie. Time Map Phonology: Finite State Models and Event Logics in Speech Recognition. Dordrecht: Springer Netherlands, 1998.
Знайти повний текст джерелаTime map phonology: Finite state models and event logics in speech recognition. Dordrecht: Kluwer, 1998.
Знайти повний текст джерелаSchulz, Klaus U., and Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.
Знайти повний текст джерелаSchulz, Klaus U., and Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.
Знайти повний текст джерелаKarttunen, Lauri. Finite-State Technology. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0018.
Повний текст джерелаAubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.
Знайти повний текст джерелаAubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.
Знайти повний текст джерелаAubry, Jean François, and Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.
Знайти повний текст джерелаЧастини книг з теми "Finite state automata"
Dai, Jack J., James I. Lathrop, Jack H. Lutz, and Elvira Mayordomo. "Finite-State Dimension." In Automata, Languages and Programming, 1028–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_83.
Повний текст джерелаSankur, Ocan. "Timed Automata Verification and Synthesis via Finite Automata Learning." In 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.
Повний текст джерелаDenis, François, Aurélien Lemay, and Alain Terlutte. "Residual Finite State Automata." In STACS 2001, 144–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44693-1_13.
Повний текст джерелаMiszczak, Jarosław Adam. "Quantum Finite State Automata." In 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.
Повний текст джерелаUnold, Olgierd, Maciej Troć, Tadeusz Dobosz, and Alicja Trusewicz. "Finite-State Molecular Computing." In Implementation and Application of Automata, 309–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45089-0_33.
Повний текст джерелаFernando, Tim. "Finite-State Temporal Projection." In Implementation and Application of Automata, 230–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11812128_22.
Повний текст джерелаCulik, Karel, and Jarkko Kari. "Finite state transformations of images." In Automata, Languages and Programming, 51–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_62.
Повний текст джерелаZhang, Kuize, Lijun Zhang, and Lihua Xie. "Detectability of Finite-State Automata." In 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.
Повний текст джерелаVilares, Manuel, Juan Otero, and Jorge Graña. "Regional Finite-State Error Repair." In 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.
Повний текст джерелаDoty, David, Jack H. Lutz, and Satyadev Nandakumar. "Finite-State Dimension and Real Arithmetic." In Automata, Languages and Programming, 537–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11786986_47.
Повний текст джерелаТези доповідей конференцій з теми "Finite state automata"
Ron, Dana, and Ronitt Rubinfeld. "Learning fallible finite state automata." In the sixth annual conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/168304.168336.
Повний текст джерелаFanton, Michel. "Finite state automata and Arabic writing." In the Workshop. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/1621753.1621759.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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: ISCA, 2001. http://dx.doi.org/10.21437/eurospeech.2001-547.
Повний текст джерела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.
Повний текст джерела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. Stroudsburg, PA, USA: Association for Computational Linguistics, 2016. http://dx.doi.org/10.18653/v1/w16-2402.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаChen, Yinkai, Rui Zhang, Xin Qiu, Xin Li, and Yuxin Deng. "Explaining GBDT by Probabilistic Finite-State Automata." In 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.
Повний текст джерелаЗвіти організацій з теми "Finite state automata"
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаBryant, R. E., E. M. Clarke, and O. Grumberg. Research on Automatic Verification of Finite-State Concurrent Systems. Fort Belvoir, VA: Defense Technical Information Center, December 1987. http://dx.doi.org/10.21236/ada188618.
Повний текст джерелаDill, David. Automatic Verification and Synthesis of Finite-State Hard Real-Time Systems. Fort Belvoir, VA: Defense Technical Information Center, May 1994. http://dx.doi.org/10.21236/ada291279.
Повний текст джерелаYan, Yujie, and Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, May 2021. http://dx.doi.org/10.17760/d20410114.
Повний текст джерела