Gotowa bibliografia na temat „Algebraic automata theory”
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 „Algebraic automata theory”.
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 "Algebraic automata theory"
Pal, Priyanka, S. P. Tiwari i Renu Verma. "Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices". New Mathematics and Natural Computation 15, nr 01 (25.12.2018): 169–90. http://dx.doi.org/10.1142/s1793005719500108.
Pełny tekst źródłaChilton, Chris, Bengt Jonsson i Marta Kwiatkowska. "An algebraic theory of interface automata". Theoretical Computer Science 549 (wrzesień 2014): 146–74. http://dx.doi.org/10.1016/j.tcs.2014.07.018.
Pełny tekst źródłaCadilhac, Michaël, Andreas Krebs i Pierre McKenzie. "The Algebraic Theory of Parikh Automata". Theory of Computing Systems 62, nr 5 (7.11.2017): 1241–68. http://dx.doi.org/10.1007/s00224-017-9817-2.
Pełny tekst źródłavan Heerdt, Gerco, Joshua Moerman, Matteo Sammartino i Alexandra Silva. "A (co)algebraic theory of succinct automata". Journal of Logical and Algebraic Methods in Programming 105 (czerwiec 2019): 112–25. http://dx.doi.org/10.1016/j.jlamp.2019.02.008.
Pełny tekst źródłaNovák, Michal, Štepán Křehlík i Kyriakos Ovaliadis. "Elements of Hyperstructure Theory in UWSN Design and Data Aggregation". Symmetry 11, nr 6 (29.05.2019): 734. http://dx.doi.org/10.3390/sym11060734.
Pełny tekst źródłaANTIĆ, CHRISTIAN. "On Cascade Products of Answer Set Programs". Theory and Practice of Logic Programming 14, nr 4-5 (lipiec 2014): 711–23. http://dx.doi.org/10.1017/s1471068414000301.
Pełny tekst źródłaDerksen, Harm, Emmanuel Jeandel i Pascal Koiran. "Quantum automata and algebraic groups". Journal of Symbolic Computation 39, nr 3-4 (marzec 2005): 357–71. http://dx.doi.org/10.1016/j.jsc.2004.11.008.
Pełny tekst źródłaAmbainis, Andris, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer i Denis Therien. "Algebraic Results on Quantum Automata". Theory of Computing Systems 39, nr 1 (29.11.2005): 165–88. http://dx.doi.org/10.1007/s00224-005-1263-x.
Pełny tekst źródłaPal, Priyanka, S. P. Tiwari i J. Kavikumar. "Measure of Operators Associated with Fuzzy Automata". New Mathematics and Natural Computation 16, nr 01 (marzec 2020): 17–35. http://dx.doi.org/10.1142/s1793005720500027.
Pełny tekst źródłaLE SAEC, BERTRAND, JEAN-ERIC PIN i PASCAL WEIL. "SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY". International Journal of Algebra and Computation 01, nr 03 (wrzesień 1991): 291–314. http://dx.doi.org/10.1142/s0218196791000195.
Pełny tekst źródłaRozprawy doktorskie na temat "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.
Pełny tekst źródłaBü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.
Pełny tekst źródłaDando, Louis-Marie. "Expressivité des automates pondérés circulaires et boustrophédons". Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0130/document.
Pełny tekst źródłaThis 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.
Pełny tekst źródłaThe 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/.
Pełny tekst źródłaChilton, 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.
Pełny tekst źródłaFerte, Julien. "Régularité et contraintes de descendance : équations algébriques". Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4713.
Pełny tekst źródłaThis 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.
Pełny tekst źródłaKatona, 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.
Pełny tekst źródłaPh.D.
Doctorate
Physics
Sciences
Physics
Brunet, Paul. "Algebras of Relations : from algorithms to formal proofs". Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1198/document.
Pełny tekst źródłaAlgebras 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
Książki na temat "Algebraic automata theory"
Bolesław, Mikołajczak, red. Algebraic and structural automata theory. Amsterdam: North-Holland Pub. Co., 1991.
Znajdź pełny tekst źródłaItÕo, Masami. Algebraic theory of automata and languages. Singapore: World Scientific, 2005.
Znajdź pełny tekst źródłaAlgebraic theory of automata and languages. River Edge, N.J: World Scientific, 2004.
Znajdź pełny tekst źródłaAlgebraic theory of automata networks: An introduction. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2005.
Znajdź pełny tekst źródłaJa, Greenglaz L., i Gvaramija, red. Algebraic structures in automata and databases theory. Singapore: World Scientific, 1992.
Znajdź pełny tekst źródłaB, Kudri︠a︡vt︠s︡ev V., Rosenberg I. G. 1939-, Goldstein Martin i NATO Public Diplomacy Division, red. Structural theory of automata, semigroups, and universal algebra. Dordrecht: Springer, 2005.
Znajdź pełny tekst źródłaM, Delorme, i Mazoyer J, red. Cellular automata: A parallel model. Dordrecht: Kluwer Academic Publishers, 1999.
Znajdź pełny tekst źródłaGraph algebras and automata. New York: Marcel Dekker, 2003.
Znajdź pełny tekst źródłaArgentina) 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. Redaktor Cortiñas, Guillermo, editor of compilation. Providence, RI: American Mathematical Society, 2012.
Znajdź pełny tekst źródłaJiří, Adámek. Automata and algebras in categories. Dordrecht: Kluwer Academic Publishers, 1990.
Znajdź pełny tekst źródłaCzęści książek na temat "Algebraic automata theory"
Cadilhac, Michaël, Andreas Krebs i Pierre McKenzie. "The Algebraic Theory of Parikh Automata". W Algebraic Informatics, 60–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40663-8_7.
Pełny tekst źródłaKuich, Werner. "The algebraic equivalent of AFL theory". W Automata, Languages and Programming, 39–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_61.
Pełny tekst źródłaHirvensalo, Mika. "Quantum Automata Theory – A Review". W 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.
Pełny tekst źródłaKuich, Werner. "Why We Need Semirings in Automata Theory (Extended Abstract)". W Algebraic Informatics, 43–44. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23021-4_4.
Pełny tekst źródłaDeng, Yuxin, i Davide Sangiorgi. "Towards an Algebraic Theory of Typed Mobile Processes". W Automata, Languages and Programming, 445–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_39.
Pełny tekst źródłaDubourg, Etienne, i David Janin. "Algebraic Tools for the Overlapping Tile Product". W 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.
Pełny tekst źródłaStark, Eugene W., Rance Cleaveland i Scott A. Smolka. "A Process-Algebraic Language for Probabilistic I/O Automata". W CONCUR 2003 - Concurrency Theory, 193–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45187-7_13.
Pełny tekst źródłaEgri-Nagy, Attila, i Chrystopher L. Nehaniv. "Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory". W 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.
Pełny tekst źródłaPiedeleu, Robin, i Fabio Zanasi. "A String Diagrammatic Axiomatisation of Finite-State Automata". W Lecture Notes in Computer Science, 469–89. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_24.
Pełny tekst źródłaBojańczyk, Mikołaj. "Algebra for trees". W Handbook of Automata Theory, 801–38. Zuerich, Switzerland: European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/22.
Pełny tekst źródłaStreszczenia konferencji na temat "Algebraic automata theory"
Zafar, Nazir Ahmad, Ajmal Hussain i Amir Ali. "Construction of Morphisms over Extended Algebraic Automata Using Z". W 2008 International Conference on Advanced Computer Theory and Engineering (ICACTE). IEEE, 2008. http://dx.doi.org/10.1109/icacte.2008.186.
Pełny tekst źródłaSheng, Ying, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine i Clark Barrett. "Politeness for the Theory of Algebraic Datatypes (Extended Abstract)". W 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.
Pełny tekst źródłaWang, Wenli, Lili Zhang, Chaoyong Jin, Zhenyou Wang i Yinhe Wang. "Teaching Elementary Linear Algebra for Automatic Control Theory". W 2019 Chinese Control Conference (CCC). IEEE, 2019. http://dx.doi.org/10.23919/chicc.2019.8865209.
Pełny tekst źródłaSadjadi, Firooz. "Algebraic invariants and their use in automatic image recognition". W Optics & Photonics 2005, redaktorzy Bahram Javidi i Demetri Psaltis. SPIE, 2005. http://dx.doi.org/10.1117/12.619916.
Pełny tekst źródłaJorabchi, Kavous, Joshua Danczyk i Krishnan Suresh. "Shape Optimization of Potentially Slender Structures". W ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-50001.
Pełny tekst źródłaAdams, A. A., H. Gottliebsen, S. A. Linton i U. Martin. "Automated theorem proving in support of computer algebra". W the 1999 international symposium. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/309831.309949.
Pełny tekst źródłaNassopoulos, George F. "Duality, uniqueness of topology and automatic continuity of *-homomorphisms in bornological locally C*-algebras". W 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.
Pełny tekst źródłaLI, HONGBO, i YIHONG WU. "AUTOMATED THEOREM PROVING IN PROJECTIVE GEOMETRY WITH BRACKET ALGEBRA". W Proceedings of the Fourth Asian Symposium (ASCM 2000). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812791962_0017.
Pełny tekst źródłaSun, Frederick, i Jonathan B. Hopkins. "Mobility Analysis of Interconnected Hybrid Flexure Systems Using Screw Algebra and Graph Theory". W 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.
Pełny tekst źródłaSrinivas, Y. L., i Debasish Dutta. "Blending and Joining Using Cyclides". W ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0170.
Pełny tekst źródłaRaporty organizacyjne na temat "Algebraic automata theory"
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łaBach, Christian Friis, i Ken Pearson. Implementing Quotas in GTAP Using GEMPACK or How to Linearize an Inequality. GTAP Technical Paper, wrzesień 2000. http://dx.doi.org/10.21642/gtap.tp04.
Pełny tekst źródła