Littérature scientifique sur le sujet « Algebraic automata theory »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Algebraic automata theory ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Algebraic automata theory"
Pal, Priyanka, S. P. Tiwari et Renu Verma. « Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices ». New Mathematics and Natural Computation 15, no 01 (25 décembre 2018) : 169–90. http://dx.doi.org/10.1142/s1793005719500108.
Texte intégralChilton, Chris, Bengt Jonsson et Marta Kwiatkowska. « An algebraic theory of interface automata ». Theoretical Computer Science 549 (septembre 2014) : 146–74. http://dx.doi.org/10.1016/j.tcs.2014.07.018.
Texte intégralCadilhac, Michaël, Andreas Krebs et Pierre McKenzie. « The Algebraic Theory of Parikh Automata ». Theory of Computing Systems 62, no 5 (7 novembre 2017) : 1241–68. http://dx.doi.org/10.1007/s00224-017-9817-2.
Texte intégralvan Heerdt, Gerco, Joshua Moerman, Matteo Sammartino et Alexandra Silva. « A (co)algebraic theory of succinct automata ». Journal of Logical and Algebraic Methods in Programming 105 (juin 2019) : 112–25. http://dx.doi.org/10.1016/j.jlamp.2019.02.008.
Texte intégralNovák, Michal, Štepán Křehlík et Kyriakos Ovaliadis. « Elements of Hyperstructure Theory in UWSN Design and Data Aggregation ». Symmetry 11, no 6 (29 mai 2019) : 734. http://dx.doi.org/10.3390/sym11060734.
Texte intégralANTIĆ, CHRISTIAN. « On Cascade Products of Answer Set Programs ». Theory and Practice of Logic Programming 14, no 4-5 (juillet 2014) : 711–23. http://dx.doi.org/10.1017/s1471068414000301.
Texte intégralDerksen, Harm, Emmanuel Jeandel et Pascal Koiran. « Quantum automata and algebraic groups ». Journal of Symbolic Computation 39, no 3-4 (mars 2005) : 357–71. http://dx.doi.org/10.1016/j.jsc.2004.11.008.
Texte intégralAmbainis, Andris, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer et Denis Therien. « Algebraic Results on Quantum Automata ». Theory of Computing Systems 39, no 1 (29 novembre 2005) : 165–88. http://dx.doi.org/10.1007/s00224-005-1263-x.
Texte intégralPal, Priyanka, S. P. Tiwari et J. Kavikumar. « Measure of Operators Associated with Fuzzy Automata ». New Mathematics and Natural Computation 16, no 01 (mars 2020) : 17–35. http://dx.doi.org/10.1142/s1793005720500027.
Texte intégralLE SAEC, BERTRAND, JEAN-ERIC PIN et PASCAL WEIL. « SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY ». International Journal of Algebra and Computation 01, no 03 (septembre 1991) : 291–314. http://dx.doi.org/10.1142/s0218196791000195.
Texte intégralThèses sur le sujet "Algebraic automata theory"
Cazalis, Daniel S. « Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications ». FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/8.
Texte intégralBüchse, Matthias. « Algebraic decoder specification : coupling formal-language theory and statistical machine translation ». Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-159266.
Texte intégralDando, Louis-Marie. « Expressivité des automates pondérés circulaires et boustrophédons ». Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0130/document.
Texte intégralThis thesis deals with some extensions of weighted automata,and studies the series they can realisedepending on the nature of their weigths.These extensions are characterised by howthe input head of the automaton is allowed to move:rotating automata can go back at the beginning of the word,and two-way automata can change the reading direction.In the general setting, weigthed rotating automata are morepowerful than classical one-way automata, and less powerfulthan two-way ones.Moreover, we introduce Hadamard expressions,which are an extension of rational expressions and can denotethe behaviour of rotating automata.The algorithms for this conversion are studied when the weights belong toa rationally additive semiring.Then, rotating automata are shown as expressive as two-way automatain the case of rational, real or complex numbers.It is also proved that two-way and one-way automataare equivalent when weighted on a locally finite bimonoid
Soyez-Martin, Claire. « From semigroup theory to vectorization : recognizing regular languages ». Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB052.
Texte intégralThe pursuit of optimizing regular expression validation has been a long-standing challenge,spanning several decades. Over time, substantial progress has been made through a vast range of approaches, spanning from ingenious new algorithms to intricate low-level optimizations.Cutting-edge tools have harnessed these optimization techniques to continually push the boundaries of efficient execution. One notable advancement is the integration of vectorization, a method that leverage low-level parallelism to process data in batches, resulting in significant performance enhancements. While there has been extensive research on designing handmade tailored algorithms for particular languages, these solutions often lack generalizability, as the underlying methodology cannot be applied indiscriminately to any regular expression, which makes it difficult to integrate to existing tools.This thesis provides a theoretical framework in which it is possible to generate vectorized programs for regular expressions corresponding to rational expressions in a given class. To do so, we rely on the algebraic theory of automata, which provides tools to process letters in parallel. These tools also allow for a deeper understanding of the underlying regular language, which gives access to some properties that are useful when producing vectorized algorithms. The contribution of this thesis is twofold. First, it provides implementations and preliminary benchmarks to study the potential efficiency of algorithms using algebra and vectorization. Second, it gives algorithms that construct vectorized programs for languages in specific classes of rational expressions, namely the first order logic and its subset restricted to two variables
Mahesar, Quratul-ain. « Computing relatively large algebraic structures by automated theory exploration ». Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/5023/.
Texte intégralChilton, Christopher James. « An algebraic theory of componentised interaction ». Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:9908e7a0-4edd-4c08-9701-d010bcaaff6e.
Texte intégralFerte, Julien. « Régularité et contraintes de descendance : équations algébriques ». Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4713.
Texte intégralThis thesis is in 3 parts.The NP-completeness of satisfiability of boolean combinations of subtree constraints is shown in the article [Ven87] ; in the part I of this thesis, we study whether adding regular contraints lets hope for keeping the same complexity. This extended model defines a new class of languages which is compared in expressivity to the Rigid Tree Automata [JKV11]. Then a begining of formalisation of the t-dags is developped.The patterns have been studied mainly from the point of view of the constraints they demand on the data. The part II of this thesis study them more finely, by putting aside the data. The skeletons are defined as calculus intermediate and the characterisation holding between their syntax and their semantics is shown. Then a pumping lemma is prooved in a restreict case, another one is conjectured in the most general case. Then fragments of boolean combinations of patterns are compared in expressivity, this parts ends with the study of complexity of model-checking, satisfiability and DTD-satisfiability on these fragments.The content of part III constitutes the article [FMS11], it is the demonstration of the characterisation of strongly-deterministic 2-level pushdown automata by recurrent catenative equation systems. This proof uses in particular, some rewriting techniques, unrewritable unknowns and noetherian orders. This characterisation provides the base case of the recurrence shown in [Sén07]
Cordy, Brendan. « Coalgebraic automata and canonical models of Moore machines ». Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=111602.
Texte intégralKatona, Gregory. « Field Theoretic Lagrangian From Off-Shell Supermultiplet Gauge Quotients ». Doctoral diss., University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5958.
Texte intégralPh.D.
Doctorate
Physics
Sciences
Physics
Brunet, Paul. « Algebras of Relations : from algorithms to formal proofs ». Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1198/document.
Texte intégralAlgebras of relations appear naturally in many contexts, in computer science as well as in mathematics. They constitute a framework well suited to the semantics of imperative programs. Kleene algebra are a starting point: these algebras enjoy very strong decidability properties, and a complete axiomatisation. The goal of this thesis was to export known results from Kleene algebra to some of its extensions. We first considered a known extension: Kleene algebras with converse. Decidability of these algebras was already known, but the algorithm witnessing this result was too complicated to be practical. We proposed a simpler algorithm, more efficient, and whose correctness is easier to establish. It allowed us to prove that this problem lies in the complexity class PSpace-complete.Then we studied Kleene allegories. Few results were known about this extension. Following results about closely related algebras, we established the equivalence between equality in Kleene allegories and equality of certain sets of graphs. We then developed an original automaton model (so-called Petri automata), based on Petri nets. We proved the equivalence between the original problem and comparing these automata. In the restricted setting of identity-free Kleene lattices, we also provided an algorithm performing this comparison. This algorithm uses exponential space. However, we proved that the problem of comparing Petri automata lies in the class ExpSpace-complete.Finally, we studied Nominal Kleene algebras. We realised that existing descriptions of these algebra were not suited to relational semantics of programming languages. We thus modified them accordingly, and doing so uncovered several natural variations of this model. We then studied formally the bridges one could build between these variations, and between the existing model and our new version of it. This study was conducted using the proof assistant Coq
Livres sur le sujet "Algebraic automata theory"
Bolesław, Mikołajczak, dir. Algebraic and structural automata theory. Amsterdam : North-Holland Pub. Co., 1991.
Trouver le texte intégralItÕo, Masami. Algebraic theory of automata and languages. Singapore : World Scientific, 2005.
Trouver le texte intégralAlgebraic theory of automata and languages. River Edge, N.J : World Scientific, 2004.
Trouver le texte intégralAlgebraic theory of automata networks : An introduction. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2005.
Trouver le texte intégralJa, Greenglaz L., et Gvaramija, dir. Algebraic structures in automata and databases theory. Singapore : World Scientific, 1992.
Trouver le texte intégralB, Kudri︠a︡vt︠s︡ev V., Rosenberg I. G. 1939-, Goldstein Martin et NATO Public Diplomacy Division, dir. Structural theory of automata, semigroups, and universal algebra. Dordrecht : Springer, 2005.
Trouver le texte intégralM, Delorme, et Mazoyer J, dir. Cellular automata : A parallel model. Dordrecht : Kluwer Academic Publishers, 1999.
Trouver le texte intégralGraph algebras and automata. New York : Marcel Dekker, 2003.
Trouver le texte intégralArgentina) Luis Santaló Winter School-CIMPA Research School Topics in Noncommutative Geometry (3rd 2010 Buenos Aires. Topics in noncommutative geometry : Third Luis Santaló Winter School-CIMPA Research School Topics in Noncommutative Geometry, Universidad de Buenos Aires, Buenos Aires, Argentina, July 26-August 6, 2010. Sous la direction de Cortiñas, Guillermo, editor of compilation. Providence, RI : American Mathematical Society, 2012.
Trouver le texte intégralJiří, Adámek. Automata and algebras in categories. Dordrecht : Kluwer Academic Publishers, 1990.
Trouver le texte intégralChapitres de livres sur le sujet "Algebraic automata theory"
Cadilhac, Michaël, Andreas Krebs et Pierre McKenzie. « The Algebraic Theory of Parikh Automata ». Dans Algebraic Informatics, 60–73. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40663-8_7.
Texte intégralKuich, Werner. « The algebraic equivalent of AFL theory ». Dans Automata, Languages and Programming, 39–50. Berlin, Heidelberg : Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_61.
Texte intégralHirvensalo, Mika. « Quantum Automata Theory – A Review ». Dans Algebraic Foundations in Computer Science, 146–67. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24897-9_7.
Texte intégralKuich, Werner. « Why We Need Semirings in Automata Theory (Extended Abstract) ». Dans Algebraic Informatics, 43–44. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23021-4_4.
Texte intégralDeng, Yuxin, et Davide Sangiorgi. « Towards an Algebraic Theory of Typed Mobile Processes ». Dans Automata, Languages and Programming, 445–56. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_39.
Texte intégralDubourg, Etienne, et David Janin. « Algebraic Tools for the Overlapping Tile Product ». Dans Language and Automata Theory and Applications, 335–46. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04921-2_27.
Texte intégralStark, Eugene W., Rance Cleaveland et Scott A. Smolka. « A Process-Algebraic Language for Probabilistic I/O Automata ». Dans CONCUR 2003 - Concurrency Theory, 193–207. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45187-7_13.
Texte intégralEgri-Nagy, Attila, et Chrystopher L. Nehaniv. « Algebraic Hierarchical Decomposition of Finite State Automata : Comparison of Implementations for Krohn-Rhodes Theory ». Dans Implementation and Application of Automata, 315–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30500-2_32.
Texte intégralPiedeleu, Robin, et Fabio Zanasi. « A String Diagrammatic Axiomatisation of Finite-State Automata ». Dans Lecture Notes in Computer Science, 469–89. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_24.
Texte intégralBojańczyk, Mikołaj. « Algebra for trees ». Dans Handbook of Automata Theory, 801–38. Zuerich, Switzerland : European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/22.
Texte intégralActes de conférences sur le sujet "Algebraic automata theory"
Zafar, Nazir Ahmad, Ajmal Hussain et Amir Ali. « Construction of Morphisms over Extended Algebraic Automata Using Z ». Dans 2008 International Conference on Advanced Computer Theory and Engineering (ICACTE). IEEE, 2008. http://dx.doi.org/10.1109/icacte.2008.186.
Texte intégralSheng, Ying, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine et Clark Barrett. « Politeness for the Theory of Algebraic Datatypes (Extended Abstract) ». Dans Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California : International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/660.
Texte intégralWang, Wenli, Lili Zhang, Chaoyong Jin, Zhenyou Wang et Yinhe Wang. « Teaching Elementary Linear Algebra for Automatic Control Theory ». Dans 2019 Chinese Control Conference (CCC). IEEE, 2019. http://dx.doi.org/10.23919/chicc.2019.8865209.
Texte intégralSadjadi, Firooz. « Algebraic invariants and their use in automatic image recognition ». Dans Optics & Photonics 2005, sous la direction de Bahram Javidi et Demetri Psaltis. SPIE, 2005. http://dx.doi.org/10.1117/12.619916.
Texte intégralJorabchi, Kavous, Joshua Danczyk et Krishnan Suresh. « Shape Optimization of Potentially Slender Structures ». Dans ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-50001.
Texte intégralAdams, A. A., H. Gottliebsen, S. A. Linton et U. Martin. « Automated theorem proving in support of computer algebra ». Dans the 1999 international symposium. New York, New York, USA : ACM Press, 1999. http://dx.doi.org/10.1145/309831.309949.
Texte intégralNassopoulos, George F. « Duality, uniqueness of topology and automatic continuity of *-homomorphisms in bornological locally C*-algebras ». Dans Topological Algebras, their Applications, and Related Topics. Warsaw : Institute of Mathematics Polish Academy of Sciences, 2005. http://dx.doi.org/10.4064/bc67-0-23.
Texte intégralLI, HONGBO, et YIHONG WU. « AUTOMATED THEOREM PROVING IN PROJECTIVE GEOMETRY WITH BRACKET ALGEBRA ». Dans Proceedings of the Fourth Asian Symposium (ASCM 2000). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812791962_0017.
Texte intégralSun, Frederick, et Jonathan B. Hopkins. « Mobility Analysis of Interconnected Hybrid Flexure Systems Using Screw Algebra and Graph Theory ». Dans ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59206.
Texte intégralSrinivas, Y. L., et Debasish Dutta. « Blending and Joining Using Cyclides ». Dans ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0170.
Texte intégralRapports d'organisations sur le sujet "Algebraic automata theory"
Borgwardt, Stefan, et 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.
Texte intégralBorgwardt, Stefan, et 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.
Texte intégralBach, Christian Friis, et Ken Pearson. Implementing Quotas in GTAP Using GEMPACK or How to Linearize an Inequality. GTAP Technical Paper, septembre 2000. http://dx.doi.org/10.21642/gtap.tp04.
Texte intégral