Articoli di riviste sul tema "Algebraic automata theory"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Algebraic automata theory".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
Pal, Priyanka, S. P. Tiwari e Renu Verma. "Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices". New Mathematics and Natural Computation 15, n. 01 (25 dicembre 2018): 169–90. http://dx.doi.org/10.1142/s1793005719500108.
Chilton, Chris, Bengt Jonsson e Marta Kwiatkowska. "An algebraic theory of interface automata". Theoretical Computer Science 549 (settembre 2014): 146–74. http://dx.doi.org/10.1016/j.tcs.2014.07.018.
Cadilhac, Michaël, Andreas Krebs e Pierre McKenzie. "The Algebraic Theory of Parikh Automata". Theory of Computing Systems 62, n. 5 (7 novembre 2017): 1241–68. http://dx.doi.org/10.1007/s00224-017-9817-2.
van Heerdt, Gerco, Joshua Moerman, Matteo Sammartino e Alexandra Silva. "A (co)algebraic theory of succinct automata". Journal of Logical and Algebraic Methods in Programming 105 (giugno 2019): 112–25. http://dx.doi.org/10.1016/j.jlamp.2019.02.008.
Novák, Michal, Štepán Křehlík e Kyriakos Ovaliadis. "Elements of Hyperstructure Theory in UWSN Design and Data Aggregation". Symmetry 11, n. 6 (29 maggio 2019): 734. http://dx.doi.org/10.3390/sym11060734.
ANTIĆ, CHRISTIAN. "On Cascade Products of Answer Set Programs". Theory and Practice of Logic Programming 14, n. 4-5 (luglio 2014): 711–23. http://dx.doi.org/10.1017/s1471068414000301.
Derksen, Harm, Emmanuel Jeandel e Pascal Koiran. "Quantum automata and algebraic groups". Journal of Symbolic Computation 39, n. 3-4 (marzo 2005): 357–71. http://dx.doi.org/10.1016/j.jsc.2004.11.008.
Ambainis, Andris, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer e Denis Therien. "Algebraic Results on Quantum Automata". Theory of Computing Systems 39, n. 1 (29 novembre 2005): 165–88. http://dx.doi.org/10.1007/s00224-005-1263-x.
Pal, Priyanka, S. P. Tiwari e J. Kavikumar. "Measure of Operators Associated with Fuzzy Automata". New Mathematics and Natural Computation 16, n. 01 (marzo 2020): 17–35. http://dx.doi.org/10.1142/s1793005720500027.
LE SAEC, BERTRAND, JEAN-ERIC PIN e PASCAL WEIL. "SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY". International Journal of Algebra and Computation 01, n. 03 (settembre 1991): 291–314. http://dx.doi.org/10.1142/s0218196791000195.
Kalampakas, Antonios. "Graph Automata and Graph Colorability". European Journal of Pure and Applied Mathematics 16, n. 1 (29 gennaio 2023): 112–20. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4629.
Kuich, Werner. "Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series". Information and Computation 165, n. 1 (febbraio 2001): 69–99. http://dx.doi.org/10.1006/inco.2000.2908.
Podlovchenko, R. I. "Finite state automata in the theory of algebraic program schemata". Proceedings of the Institute for System Programming of the RAS 27, n. 2 (2015): 161–72. http://dx.doi.org/10.15514/ispras-2015-27(2)-10.
Kedlaya, Kiran S. "Finite automata and algebraic extensions of function fields". Journal de Théorie des Nombres de Bordeaux 18, n. 2 (2006): 379–420. http://dx.doi.org/10.5802/jtnb.551.
Křehlík, Štěpán. "n-Ary Cartesian Composition of Multiautomata with Internal Link for Autonomous Control of Lane Shifting". Mathematics 8, n. 5 (21 maggio 2020): 835. http://dx.doi.org/10.3390/math8050835.
Kim, S. H., e N. P. Suh. "Mathematical Foundations for Manufacturing". Journal of Engineering for Industry 109, n. 3 (1 agosto 1987): 213–18. http://dx.doi.org/10.1115/1.3187121.
Ebas, Nur Ain, Nor Shamsidah Amir Hamzah, Kavikumar Jacob e Mohd Saifullah Rusiman. "Fuzzy Finite Switchboard Automata with Complete Residuated Lattices". International Journal of Engineering & Technology 7, n. 4.30 (30 novembre 2018): 160. http://dx.doi.org/10.14419/ijet.v7i4.30.22099.
Cardona, R., e N. Galatos. "The finite embeddability property for noncommutative knotted extensions of RL". International Journal of Algebra and Computation 25, n. 03 (9 aprile 2015): 349–79. http://dx.doi.org/10.1142/s0218196715500010.
Letychevskyi, Oleksandr. "Algebraic School of V.M. Glushkov and Insertion Modeling". Cybernetics and Computer Technologies, n. 4 (4 dicembre 2023): 8–15. http://dx.doi.org/10.34229/2707-451x.23.4.2.
Comin, Carlo. "Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata". Fundamenta Informaticae 134, n. 3-4 (2014): 335–53. http://dx.doi.org/10.3233/fi-2014-1105.
Semerenko, Vasyl, e Oleksandr Voinalovich. "The simplification of computationals in error correction coding". Technology audit and production reserves 3, n. 2(59) (30 giugno 2021): 24–28. http://dx.doi.org/10.15587/2706-5448.2021.233656.
Jin, Jianhua, Qingguo Li e Chunquan Li. "On Intuitionistic Fuzzy Context-Free Languages". Journal of Applied Mathematics 2013 (2013): 1–16. http://dx.doi.org/10.1155/2013/825249.
Chen, Yu-Fang, Kai-Min Chung, Ondřej Lengál, Jyun-Ao Lin, Wei-Lun Tsai e Di-De Yen. "An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits". Proceedings of the ACM on Programming Languages 7, PLDI (6 giugno 2023): 1218–43. http://dx.doi.org/10.1145/3591270.
Attou, Samira, Ludovic Mignot, Clément Miklarz e Florent Nicart. "Monadic Expressions and Their Derivatives". RAIRO - Theoretical Informatics and Applications 58 (2024): 6. http://dx.doi.org/10.1051/ita/2023014.
Gulistan, Muhammad, Feng Feng, Madad Khan e Aslıhan Sezgin. "Characterizations of Right Weakly Regular Semigroups in Terms of Generalized Cubic Soft Sets". Mathematics 6, n. 12 (30 novembre 2018): 293. http://dx.doi.org/10.3390/math6120293.
Bystrova, I. V., e B. P. Podkopaev. "Fault Isolation in Network of State Automates". Journal of the Russian Universities. Radioelectronics 23, n. 1 (28 febbraio 2020): 18–29. http://dx.doi.org/10.32603/1993-8985-2020-23-1-18-29.
Denis, Laurent. "Méthodes fonctionnelles pour la transcendance en caractéristique finie". Bulletin of the Australian Mathematical Society 50, n. 2 (ottobre 1994): 273–86. http://dx.doi.org/10.1017/s0004972700013733.
Jones, Nick G., e Noah Linden. "Integrable spin chains and the Clifford group". Journal of Mathematical Physics 63, n. 10 (1 ottobre 2022): 101901. http://dx.doi.org/10.1063/5.0095870.
KÁDÁR, ZOLTÁN, ANNALISA MARZUOLI e MARIO RASETTI. "BRAIDING AND ENTANGLEMENT IN SPIN NETWORKS: A COMBINATORIAL APPROACH TO TOPOLOGICAL PHASES". International Journal of Quantum Information 07, supp01 (gennaio 2009): 195–203. http://dx.doi.org/10.1142/s0219749909004785.
Picantin, Matthieu. "Automatic Structures for Torus Link Groups". Journal of Knot Theory and Its Ramifications 12, n. 06 (settembre 2003): 833–66. http://dx.doi.org/10.1142/s0218216503002627.
Gornev, E. S., e I. V. Matyushkin. "A discussion of S.M. Krylov’s book «Neocybernetics» (2008)". Russian Technological Journal 9, n. 6 (2 dicembre 2021): 73–87. http://dx.doi.org/10.32362/2500-316x-2021-9-6-73-87.
Гайдур, Галина Іванівна, Сергій Олександрович Гахов e Віталій Вікторович Марченко. "Метод побудови динамічної моделі логічного об’єкта інформаційної системи та визначення закону його функціонування". RADIOELECTRONIC AND COMPUTER SYSTEMS, n. 1 (23 febbraio 2022): 129–40. http://dx.doi.org/10.32620/reks.2022.1.10.
Brieussel, Jérémie. "An automata group of intermediate growth and exponential activity". Journal of Group Theory 21, n. 4 (1 luglio 2018): 573–78. http://dx.doi.org/10.1515/jgth-2017-0046.
Wiweger, Antoni. "Free Games over Coloured Automata". Fundamenta Informaticae 8, n. 2 (1 aprile 1985): 199–224. http://dx.doi.org/10.3233/fi-1985-8204.
Champarnaud, J. M., e G. Hansel. "AUTOMATE, a computing package for automata and finite semigroups". Journal of Symbolic Computation 12, n. 2 (agosto 1991): 197–220. http://dx.doi.org/10.1016/s0747-7171(08)80125-3.
D'Angeli, Daniele, Dominik Francoeur, Emanuele Rodaro e Jan Philipp Wächter. "On the orbits of automaton semigroups and groups". Algebra and Discrete Mathematics 33, n. 1 (2022): 1–29. http://dx.doi.org/10.12958/adm1692.
FABERT, OLIVER. "LOCAL SYMPLECTIC FIELD THEORY". International Journal of Mathematics 24, n. 05 (maggio 2013): 1350041. http://dx.doi.org/10.1142/s0129167x13500419.
Peltier, Nicolas. "Tree Automata and Automated Model Building". Fundamenta Informaticae 30, n. 1 (1997): 59–81. http://dx.doi.org/10.3233/fi-1997-30105.
Martiník, Ivo. "Automation of Presentation Record Production Based on Rich-Media Technology Using SNT Petri Nets Theory". Scientific World Journal 2015 (2015): 1–19. http://dx.doi.org/10.1155/2015/303705.
Dunets, Andriy, Gerhard Schellhorn e Wolfgang Reif. "Automated Flaw Detection in Algebraic Specifications". Journal of Automated Reasoning 45, n. 4 (29 gennaio 2010): 359–95. http://dx.doi.org/10.1007/s10817-010-9166-1.
Ganty, Pierre, Elena Gutiérrez e Pedro Valero. "A Congruence-Based Perspective on Finite Tree Automata". Fundamenta Informaticae 184, n. 1 (10 gennaio 2022): 1–47. http://dx.doi.org/10.3233/fi-2021-2091.
Otto, Friedrich. "A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*". Fundamenta Informaticae 180, n. 1-2 (12 maggio 2021): 77–101. http://dx.doi.org/10.3233/fi-2021-2035.
Kutylowski, Miroslaw. "Chains of Finite Automat a with Bounded Number of Chains1". Fundamenta Informaticae 11, n. 3 (1 luglio 1988): 267–73. http://dx.doi.org/10.3233/fi-1988-11304.
Löding, Christof, e Max Philip Stachon. "On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words". Fundamenta Informaticae 189, n. 1 (7 luglio 2023): 69–91. http://dx.doi.org/10.3233/fi-222152.
Fernau, Henning, Martin Kutrib e Matthias Wendlandt. "Self-Verifying Pushdown and Queue Automata". Fundamenta Informaticae 180, n. 1-2 (12 maggio 2021): 1–28. http://dx.doi.org/10.3233/fi-2021-2032.
Pighizzini, Giovanni, e Luca Prigioniero. "Non-Self-Embedding Grammars and Descriptional Complexity". Fundamenta Informaticae 180, n. 1-2 (12 maggio 2021): 103–22. http://dx.doi.org/10.3233/fi-2021-2036.
Černý, Anton, e Jozef Gruska. "Modular Real-Time Trellis Automata". Fundamenta Informaticae 9, n. 3 (1 luglio 1986): 253–82. http://dx.doi.org/10.3233/fi-1986-9302.
Beyne, Tim, e Michiel Verbauwhede. "Integral Cryptanalysis Using Algebraic Transition Matrices". IACR Transactions on Symmetric Cryptology 2023, n. 4 (8 dicembre 2023): 244–69. http://dx.doi.org/10.46586/tosc.v2023.i4.244-269.
Dobronravov, Egor, Nikita Dobronravov e Alexander Okhotin. "On the Length of Shortest Strings Accepted by Two-way Finite Automata". Fundamenta Informaticae 180, n. 4 (30 giugno 2021): 315–31. http://dx.doi.org/10.3233/fi-2021-2044.
Sakai, Masahiko, Toshiki Sakabe e Yasuyoshi Inagaki. "Algebraic specification and automatic generation of compilers". Systems and Computers in Japan 23, n. 2 (1992): 1–13. http://dx.doi.org/10.1002/scj.4690230201.