Gotowa bibliografia na temat „Finite state automata”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł 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.
Artykuły w czasopismach na temat "Finite state automata"
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łaBASU, 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łaPraba, 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łaCarrasco, 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łaKavikumar, 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łaSALOMAA, 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łaAlawida, 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łaKaunang, 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łaKaur, 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łaBernadotte, 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łaRozprawy doktorskie na temat "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.
Pełny tekst źródłaFRANCH, Daniel Kudlowiez. "Dynamical system modeling with probabilistic finite state automata". Universidade Federal de Pernambuco, 2017. https://repositorio.ufpe.br/handle/123456789/25448.
Pełny tekst źródłaApproved 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.
Pełny tekst źródłaBird, 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.
Pełny tekst źródłaEgri-Nagy, Attila. "Algebraic hierarchical decomposition of finite state automata : a computational approach". Thesis, University of Hertfordshire, 2005. http://hdl.handle.net/2299/14267.
Pełny tekst źródłaCazalis, Daniel S. "Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications". FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/8.
Pełny tekst źródłaMakarov, 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.
Pełny tekst źródłaAtchuta, Kaushik. "Slicing of extended finite state machines". Kansas State University, 2014. http://hdl.handle.net/2097/17640.
Pełny tekst źródłaDepartment 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.
Pełny tekst źródłaHulden, Mans. "Finite-state Machine Construction Methods and Algorithms for Phonology and Morphology". Diss., The University of Arizona, 2009. http://hdl.handle.net/10150/196112.
Pełny tekst źródłaKsiążki na temat "Finite state automata"
Sifakis, Joseph, red. Automatic Verification Methods for Finite State Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52148-8.
Pełny tekst źródłaFerdinand, Wagner, red. Modeling software with finite state machines: A practical approach. Boca Raton, FL: Taylor & Francis, 2006.
Znajdź pełny tekst źródłaCarson-Berndsen, Julie. Time Map Phonology: Finite State Models and Event Logics in Speech Recognition. Dordrecht: Springer Netherlands, 1998.
Znajdź pełny tekst źródłaTime map phonology: Finite state models and event logics in speech recognition. Dordrecht: Kluwer, 1998.
Znajdź pełny tekst źródłaSchulz, Klaus U., i Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.
Znajdź pełny tekst źródłaSchulz, Klaus U., i Stoyan Mihov. Finite-State Techniques: Automata, Transducers and Bimachines. Cambridge University Press, 2019.
Znajdź pełny tekst źródłaKarttunen, Lauri. Finite-State Technology. Redaktor Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0018.
Pełny tekst źródłaAubry, Jean François, i Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.
Znajdź pełny tekst źródłaAubry, Jean François, i Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.
Znajdź pełny tekst źródłaAubry, Jean François, i Nicolae Brinzei. Systems Dependability Assessment: Modeling with Graphs and Finite State Automata. Wiley & Sons, Incorporated, John, 2015.
Znajdź pełny tekst źródłaCzęści książek na temat "Finite state automata"
Dai, Jack J., James I. Lathrop, Jack H. Lutz i Elvira Mayordomo. "Finite-State Dimension". W Automata, Languages and Programming, 1028–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_83.
Pełny tekst źródłaSankur, Ocan. "Timed Automata Verification and Synthesis via Finite Automata Learning". W 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.
Pełny tekst źródłaDenis, François, Aurélien Lemay i Alain Terlutte. "Residual Finite State Automata". W STACS 2001, 144–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44693-1_13.
Pełny tekst źródłaMiszczak, Jarosław Adam. "Quantum Finite State Automata". W 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.
Pełny tekst źródłaUnold, Olgierd, Maciej Troć, Tadeusz Dobosz i Alicja Trusewicz. "Finite-State Molecular Computing". W Implementation and Application of Automata, 309–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45089-0_33.
Pełny tekst źródłaFernando, Tim. "Finite-State Temporal Projection". W Implementation and Application of Automata, 230–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11812128_22.
Pełny tekst źródłaCulik, Karel, i Jarkko Kari. "Finite state transformations of images". W Automata, Languages and Programming, 51–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_62.
Pełny tekst źródłaZhang, Kuize, Lijun Zhang i Lihua Xie. "Detectability of Finite-State Automata". W 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.
Pełny tekst źródłaVilares, Manuel, Juan Otero i Jorge Graña. "Regional Finite-State Error Repair". W 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.
Pełny tekst źródłaDoty, David, Jack H. Lutz i Satyadev Nandakumar. "Finite-State Dimension and Real Arithmetic". W Automata, Languages and Programming, 537–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11786986_47.
Pełny tekst źródłaStreszczenia konferencji na temat "Finite state automata"
Ron, Dana, i Ronitt Rubinfeld. "Learning fallible finite state automata". W the sixth annual conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/168304.168336.
Pełny tekst źródłaFanton, Michel. "Finite state automata and Arabic writing". W the Workshop. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/1621753.1621759.
Pełny tekst źródłaFulop, Endre, i Norbert Pataki. "Symbolic Execution with Finite State Automata". W 2019 IEEE 15th International Scientific Conference on Informatics. IEEE, 2019. http://dx.doi.org/10.1109/informatics47936.2019.9119287.
Pełny tekst źródłaRanhel, Joao. "Neural Assemblies and Finite State Automata". W 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.
Pełny tekst źródłaPastor-i-Gadea, M., i F. Casacuberta. "Automatic learning of finite state automata for pronunciation modeling". W 7th European Conference on Speech Communication and Technology (Eurospeech 2001). ISCA: ISCA, 2001. http://dx.doi.org/10.21437/eurospeech.2001-547.
Pełny tekst źródłaAdenis, Patrick, Kushal Mukherjee i Asok Ray. "State splitting and state merging in probabilistic finite state automata". W 2011 American Control Conference. IEEE, 2011. http://dx.doi.org/10.1109/acc.2011.5990861.
Pełny tekst źródłaTeichmann, Christoph, Kasimir Wansing i Alexander Koller. "Adaptive Importance Sampling from Finite State Automata". W 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.
Pełny tekst źródłaAbuSafiya, Majed. "Measuring Documents Similarity using Finite State Automata". W 2020 2nd International Conference on Mathematics and Information Technology (ICMIT). IEEE, 2020. http://dx.doi.org/10.1109/icmit47780.2020.9047016.
Pełny tekst źródłaBala, V., i N. Rubin. "Efficient instruction scheduling using finite state automata". W Proceedings of MICRO'95: 28th Annual IEEE/ACM International Symposium on Microarchitecture. IEEE, 1995. http://dx.doi.org/10.1109/micro.1995.476812.
Pełny tekst źródłaChen, Yinkai, Rui Zhang, Xin Qiu, Xin Li i Yuxin Deng. "Explaining GBDT by Probabilistic Finite-State Automata". W 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.
Pełny tekst źródłaRaporty organizacyjne na temat "Finite state automata"
Borgwardt, Stefan, i 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.
Pełny tekst źródłaBorgwardt, Stefan, i 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.
Pełny tekst źródłaBaader, Franz, i Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.
Pełny tekst źródłaBryant, R. E., E. M. Clarke i O. Grumberg. Research on Automatic Verification of Finite-State Concurrent Systems. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1987. http://dx.doi.org/10.21236/ada188618.
Pełny tekst źródłaDill, David. Automatic Verification and Synthesis of Finite-State Hard Real-Time Systems. Fort Belvoir, VA: Defense Technical Information Center, maj 1994. http://dx.doi.org/10.21236/ada291279.
Pełny tekst źródłaYan, Yujie, i Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, maj 2021. http://dx.doi.org/10.17760/d20410114.
Pełny tekst źródła