Статті в журналах з теми "Finite state automata"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Finite state automata".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаChigahara, Hiroyuki, Szilárd Zsolt Fazekas, and Akihiro Yamamura. "One-Way Jumping Finite Automata." International Journal of Foundations of Computer Science 27, no. 03 (February 2016): 391–405. http://dx.doi.org/10.1142/s0129054116400165.
Повний текст джерелаADAMATZKY, ANDREW. "ON OSCILLATORS IN PHYLLOSILICATE EXCITABLE AUTOMATA." International Journal of Modern Physics C 24, no. 06 (May 2013): 1350034. http://dx.doi.org/10.1142/s0129183113500344.
Повний текст джерела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 (December 6, 2010): 21996–2001. http://dx.doi.org/10.1073/pnas.1015858107.
Повний текст джерелаPIGHIZZINI, GIOVANNI. "DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES." International Journal of Foundations of Computer Science 20, no. 04 (August 2009): 629–45. http://dx.doi.org/10.1142/s0129054109006784.
Повний текст джерелаBenson, Karl. "Performing automatic target detection with evolvable finite state automata." Image and Vision Computing 20, no. 9-10 (August 2002): 631–38. http://dx.doi.org/10.1016/s0262-8856(02)00052-5.
Повний текст джерелаDaciuk, Jan, Stoyan Mihov, Bruce W. Watson, and Richard E. Watson. "Incremental Construction of Minimal Acyclic Finite-State Automata." Computational Linguistics 26, no. 1 (March 2000): 3–16. http://dx.doi.org/10.1162/089120100561601.
Повний текст джерелаBeier, Simon, Markus Holzer, and Martin Kutrib. "Operational State Complexity and Decidability of Jumping Finite Automata." International Journal of Foundations of Computer Science 30, no. 01 (January 2019): 5–27. http://dx.doi.org/10.1142/s012905411940001x.
Повний текст джерелаRiXian Liu. "L-Fuzzy ��-Finite state Buchi automata." International Journal of Advancements in Computing Technology 5, no. 3 (February 15, 2013): 738–44. http://dx.doi.org/10.4156/ijact.vol5.issue3.86.
Повний текст джерелаMajumdar, Dipankar, and Swapan Bhattacharya. "Interoperability of constrained finite state automata." ACM SIGSOFT Software Engineering Notes 37, no. 2 (April 3, 2012): 1–8. http://dx.doi.org/10.1145/2108144.2108155.
Повний текст джерелаQuenneville, Charles. "Image coding using finite state automata." Optical Engineering 35, no. 1 (January 1, 1996): 113. http://dx.doi.org/10.1117/1.600881.
Повний текст джерелаSteinberg, Benjamin. "Finite state automata: A geometric approach." Transactions of the American Mathematical Society 353, no. 9 (May 4, 2001): 3409–64. http://dx.doi.org/10.1090/s0002-9947-01-02774-x.
Повний текст джерелаDaciuk, Jan, and Dawid Weiss. "Smaller representation of finite state automata." Theoretical Computer Science 450 (September 2012): 10–21. http://dx.doi.org/10.1016/j.tcs.2012.04.023.
Повний текст джерелаSharan, Shambhu, Arun K. Srivastava, and S. P. Tiwari. "Characterizations of rough finite state automata." International Journal of Machine Learning and Cybernetics 8, no. 3 (May 7, 2015): 721–30. http://dx.doi.org/10.1007/s13042-015-0372-3.
Повний текст джерелаKryvyi, S. L. "Finite-state automata in information technologies." Cybernetics and Systems Analysis 47, no. 5 (September 2011): 669–83. http://dx.doi.org/10.1007/s10559-011-9347-x.
Повний текст джерелаVAN ZIJL, LYNETTE. "MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS." International Journal of Foundations of Computer Science 16, no. 05 (October 2005): 1027–38. http://dx.doi.org/10.1142/s0129054105003455.
Повний текст джерелаBORDIHN, HENNING, MARKUS HOLZER, and MARTIN KUTRIB. "HYBRID EXTENDED FINITE AUTOMATA." International Journal of Foundations of Computer Science 18, no. 04 (August 2007): 745–60. http://dx.doi.org/10.1142/s0129054107004954.
Повний текст джерелаMACARIE, IOAN I. "A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA." International Journal of Foundations of Computer Science 07, no. 04 (December 1996): 329–37. http://dx.doi.org/10.1142/s0129054196000233.
Повний текст джерелаSusanto, Susanto, Venny Yulianty, Bobby Suryo Prakoso, Suwanda Suwanda, Windu Gata, and Kresna Ramanda. "Desain Finite State Automata Untuk Merancang Vending Automata Logam Mulia." BINA INSANI ICT JOURNAL 8, no. 2 (December 13, 2021): 113. http://dx.doi.org/10.51211/biict.v8i2.1572.
Повний текст джерелаÉSIK, ZOLTÁN. "Equational axioms associated with finite automata for fixed point operations in cartesian categories." Mathematical Structures in Computer Science 27, no. 1 (April 8, 2015): 54–69. http://dx.doi.org/10.1017/s0960129515000031.
Повний текст джерелаNagy, Benedek. "State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters." Electronic Proceedings in Theoretical Computer Science 386 (September 3, 2023): 170–84. http://dx.doi.org/10.4204/eptcs.386.14.
Повний текст джерелаLapin, Eduard S., and Marat I. Abdrakhmanov. "Functional approach to deterministic finite-state automata systems dynamic modeling." Izvestiya vysshikh uchebnykh zavedenii. Gornyi zhurnal 1 (March 30, 2021): 113–22. http://dx.doi.org/10.21440/0536-1028-2021-2-113-122.
Повний текст джерелаBOUMA, GOSSE. "Finite state methods for hyphenation." Natural Language Engineering 9, no. 1 (March 2003): 5–20. http://dx.doi.org/10.1017/s1351324903003073.
Повний текст джерелаAdamatzky, Andrew. "On Binary-State Phyllosilicate Automata." International Journal of Bifurcation and Chaos 25, no. 03 (March 2015): 1550035. http://dx.doi.org/10.1142/s0218127415500352.
Повний текст джерелаKUTRIB, MARTIN, ANDREAS MALCHER, and MATTHIAS WENDLANDT. "SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA." International Journal of Foundations of Computer Science 25, no. 07 (November 2014): 877–96. http://dx.doi.org/10.1142/s0129054114400139.
Повний текст джерелаBadr, Andrew, Viliam Geffert, and Ian Shipman. "Hyper-minimizing minimized deterministic finite state automata." RAIRO - Theoretical Informatics and Applications 43, no. 1 (December 20, 2007): 69–94. http://dx.doi.org/10.1051/ita:2007061.
Повний текст джерелаReger, Johann. "CYCLE ANALYSIS FOR DETERMINISTIC FINITE STATE AUTOMATA." IFAC Proceedings Volumes 35, no. 1 (2002): 247–52. http://dx.doi.org/10.3182/20020721-6-es-1901.00529.
Повний текст джерелаJindal, Rajni, and Shraddha Singhai. "Finite State Automata Evolution Using Modular Architecture." Journal of Algorithms & Computational Technology 4, no. 4 (December 2010): 495–509. http://dx.doi.org/10.1260/1748-3018.4.4.495.
Повний текст джерелаRay *, Asok, Jinbo Fu, and Constantino Lagoa. "Optimal supervisory control of finite state automata." International Journal of Control 77, no. 12 (August 15, 2004): 1083–100. http://dx.doi.org/10.1080/0020717042000273762.
Повний текст джерелаGoldberg, Robert R., and Jerry Waxman. "Parallel decision procedures for finite state automata." International Journal of Computer Mathematics 49, no. 1-2 (January 1993): 33–40. http://dx.doi.org/10.1080/00207169308804213.
Повний текст джерелаCleeremans, Axel, David Servan-Schreiber, and James L. McClelland. "Finite State Automata and Simple Recurrent Networks." Neural Computation 1, no. 3 (September 1989): 372–81. http://dx.doi.org/10.1162/neco.1989.1.3.372.
Повний текст джерелаArulprakasam, R., R. Perumal, M. Radhakrishnan, and V. R. Dare. "Rough Finite State Automata and Rough Languages." Journal of Physics: Conference Series 1000 (April 2018): 012155. http://dx.doi.org/10.1088/1742-6596/1000/1/012155.
Повний текст джерелаGanesh, Natesh, and Neal G. Anderson. "Irreversibility and dissipation in finite-state automata." Physics Letters A 377, no. 45-48 (December 2013): 3266–71. http://dx.doi.org/10.1016/j.physleta.2013.10.010.
Повний текст джерелаBala, Vasanth, and Norman Rubin. "Efficient instruction scheduling using finite state automata." International Journal of Parallel Programming 25, no. 2 (April 1997): 53–82. http://dx.doi.org/10.1007/bf02700047.
Повний текст джерелаNISHIKAWA, TOSHITAMI, and YASUHIKO TAKAHARA. "CHARACTERIZATION OF FINITE STATE AUTOMATA—TOPOLOGICAL APPROACH." International Journal of General Systems 20, no. 3 (March 1992): 221–31. http://dx.doi.org/10.1080/03081079208945032.
Повний текст джерелаDzelme-Bērziņa, Ilze. "Mathematical logic and quantum finite state automata." Theoretical Computer Science 410, no. 20 (May 2009): 1952–59. http://dx.doi.org/10.1016/j.tcs.2009.01.030.
Повний текст джерелаJonoska, Nataša, and Joni B. Pirnot. "Finite state automata representing two-dimensional subshifts." Theoretical Computer Science 410, no. 37 (September 2009): 3504–12. http://dx.doi.org/10.1016/j.tcs.2009.03.015.
Повний текст джерелаGanguly, Debayan, Kingshuk Chatterjee, and Kumar Sankar Ray. "1-Way Multihead Quantum Finite State Automata." Applied Mathematics 07, no. 09 (2016): 1005–22. http://dx.doi.org/10.4236/am.2016.79088.
Повний текст джерелаGoldberg, R. R. "Finite State Automata from Regular Expression Trees." Computer Journal 36, no. 7 (July 1, 1993): 623–30. http://dx.doi.org/10.1093/comjnl/36.7.623.
Повний текст джерелаShemesh, Y., and N. Francez. "Finite-State Unification Automata and Relational Languages." Information and Computation 114, no. 2 (November 1994): 192–213. http://dx.doi.org/10.1006/inco.1994.1085.
Повний текст джерелаĆirić, Miroslav, Ivana Micić, Stefan Stanimirović, and Linh Anh Nguyen. "Approximate State Reduction of Fuzzy Finite Automata." Electronic Proceedings in Theoretical Computer Science 386 (September 3, 2023): 51–66. http://dx.doi.org/10.4204/eptcs.386.6.
Повний текст джерела