Literatura científica selecionada sobre o tema "Algebraic automata theory"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Algebraic automata theory".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Algebraic automata theory"
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 de dezembro de 2018): 169–90. http://dx.doi.org/10.1142/s1793005719500108.
Texto completo da fonteChilton, Chris, Bengt Jonsson e Marta Kwiatkowska. "An algebraic theory of interface automata". Theoretical Computer Science 549 (setembro de 2014): 146–74. http://dx.doi.org/10.1016/j.tcs.2014.07.018.
Texto completo da fonteCadilhac, Michaël, Andreas Krebs e Pierre McKenzie. "The Algebraic Theory of Parikh Automata". Theory of Computing Systems 62, n.º 5 (7 de novembro de 2017): 1241–68. http://dx.doi.org/10.1007/s00224-017-9817-2.
Texto completo da fontevan 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 (junho de 2019): 112–25. http://dx.doi.org/10.1016/j.jlamp.2019.02.008.
Texto completo da fonteNová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 de maio de 2019): 734. http://dx.doi.org/10.3390/sym11060734.
Texto completo da fonteANTIĆ, CHRISTIAN. "On Cascade Products of Answer Set Programs". Theory and Practice of Logic Programming 14, n.º 4-5 (julho de 2014): 711–23. http://dx.doi.org/10.1017/s1471068414000301.
Texto completo da fonteDerksen, Harm, Emmanuel Jeandel e Pascal Koiran. "Quantum automata and algebraic groups". Journal of Symbolic Computation 39, n.º 3-4 (março de 2005): 357–71. http://dx.doi.org/10.1016/j.jsc.2004.11.008.
Texto completo da fonteAmbainis, 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 de novembro de 2005): 165–88. http://dx.doi.org/10.1007/s00224-005-1263-x.
Texto completo da fontePal, Priyanka, S. P. Tiwari e J. Kavikumar. "Measure of Operators Associated with Fuzzy Automata". New Mathematics and Natural Computation 16, n.º 01 (março de 2020): 17–35. http://dx.doi.org/10.1142/s1793005720500027.
Texto completo da fonteLE 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 (setembro de 1991): 291–314. http://dx.doi.org/10.1142/s0218196791000195.
Texto completo da fonteTeses / dissertações sobre o assunto "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.
Texto completo da fonteBü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.
Texto completo da fonteDando, Louis-Marie. "Expressivité des automates pondérés circulaires et boustrophédons". Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0130/document.
Texto completo da fonteThis 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.
Texto completo da fonteThe 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/.
Texto completo da fonteChilton, 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.
Texto completo da fonteFerte, Julien. "Régularité et contraintes de descendance : équations algébriques". Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4713.
Texto completo da fonteThis 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.
Texto completo da fonteKatona, 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.
Texto completo da fontePh.D.
Doctorate
Physics
Sciences
Physics
Brunet, Paul. "Algebras of Relations : from algorithms to formal proofs". Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1198/document.
Texto completo da fonteAlgebras 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
Livros sobre o assunto "Algebraic automata theory"
Bolesław, Mikołajczak, ed. Algebraic and structural automata theory. Amsterdam: North-Holland Pub. Co., 1991.
Encontre o texto completo da fonteItÕo, Masami. Algebraic theory of automata and languages. Singapore: World Scientific, 2005.
Encontre o texto completo da fonteAlgebraic theory of automata and languages. River Edge, N.J: World Scientific, 2004.
Encontre o texto completo da fonteAlgebraic theory of automata networks: An introduction. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2005.
Encontre o texto completo da fonteJa, Greenglaz L., e Gvaramija, eds. Algebraic structures in automata and databases theory. Singapore: World Scientific, 1992.
Encontre o texto completo da fonteB, Kudri︠a︡vt︠s︡ev V., Rosenberg I. G. 1939-, Goldstein Martin e NATO Public Diplomacy Division, eds. Structural theory of automata, semigroups, and universal algebra. Dordrecht: Springer, 2005.
Encontre o texto completo da fonteM, Delorme, e Mazoyer J, eds. Cellular automata: A parallel model. Dordrecht: Kluwer Academic Publishers, 1999.
Encontre o texto completo da fonteGraph algebras and automata. New York: Marcel Dekker, 2003.
Encontre o texto completo da fonteArgentina) 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. Editado por Cortiñas, Guillermo, editor of compilation. Providence, RI: American Mathematical Society, 2012.
Encontre o texto completo da fonteJiří, Adámek. Automata and algebras in categories. Dordrecht: Kluwer Academic Publishers, 1990.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Algebraic automata theory"
Cadilhac, Michaël, Andreas Krebs e Pierre McKenzie. "The Algebraic Theory of Parikh Automata". In Algebraic Informatics, 60–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40663-8_7.
Texto completo da fonteKuich, Werner. "The algebraic equivalent of AFL theory". In Automata, Languages and Programming, 39–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_61.
Texto completo da fonteHirvensalo, Mika. "Quantum Automata Theory – A Review". In 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.
Texto completo da fonteKuich, Werner. "Why We Need Semirings in Automata Theory (Extended Abstract)". In Algebraic Informatics, 43–44. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23021-4_4.
Texto completo da fonteDeng, Yuxin, e Davide Sangiorgi. "Towards an Algebraic Theory of Typed Mobile Processes". In Automata, Languages and Programming, 445–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_39.
Texto completo da fonteDubourg, Etienne, e David Janin. "Algebraic Tools for the Overlapping Tile Product". In 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.
Texto completo da fonteStark, Eugene W., Rance Cleaveland e Scott A. Smolka. "A Process-Algebraic Language for Probabilistic I/O Automata". In CONCUR 2003 - Concurrency Theory, 193–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45187-7_13.
Texto completo da fonteEgri-Nagy, Attila, e Chrystopher L. Nehaniv. "Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory". In 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.
Texto completo da fontePiedeleu, Robin, e Fabio Zanasi. "A String Diagrammatic Axiomatisation of Finite-State Automata". In Lecture Notes in Computer Science, 469–89. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_24.
Texto completo da fonteBojańczyk, Mikołaj. "Algebra for trees". In Handbook of Automata Theory, 801–38. Zuerich, Switzerland: European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/22.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Algebraic automata theory"
Zafar, Nazir Ahmad, Ajmal Hussain e Amir Ali. "Construction of Morphisms over Extended Algebraic Automata Using Z". In 2008 International Conference on Advanced Computer Theory and Engineering (ICACTE). IEEE, 2008. http://dx.doi.org/10.1109/icacte.2008.186.
Texto completo da fonteSheng, Ying, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine e Clark Barrett. "Politeness for the Theory of Algebraic Datatypes (Extended Abstract)". In 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.
Texto completo da fonteWang, Wenli, Lili Zhang, Chaoyong Jin, Zhenyou Wang e Yinhe Wang. "Teaching Elementary Linear Algebra for Automatic Control Theory". In 2019 Chinese Control Conference (CCC). IEEE, 2019. http://dx.doi.org/10.23919/chicc.2019.8865209.
Texto completo da fonteSadjadi, Firooz. "Algebraic invariants and their use in automatic image recognition". In Optics & Photonics 2005, editado por Bahram Javidi e Demetri Psaltis. SPIE, 2005. http://dx.doi.org/10.1117/12.619916.
Texto completo da fonteJorabchi, Kavous, Joshua Danczyk e Krishnan Suresh. "Shape Optimization of Potentially Slender Structures". In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-50001.
Texto completo da fonteAdams, A. A., H. Gottliebsen, S. A. Linton e U. Martin. "Automated theorem proving in support of computer algebra". In the 1999 international symposium. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/309831.309949.
Texto completo da fonteNassopoulos, George F. "Duality, uniqueness of topology and automatic continuity of *-homomorphisms in bornological locally C*-algebras". In 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.
Texto completo da fonteLI, HONGBO, e YIHONG WU. "AUTOMATED THEOREM PROVING IN PROJECTIVE GEOMETRY WITH BRACKET ALGEBRA". In Proceedings of the Fourth Asian Symposium (ASCM 2000). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812791962_0017.
Texto completo da fonteSun, Frederick, e Jonathan B. Hopkins. "Mobility Analysis of Interconnected Hybrid Flexure Systems Using Screw Algebra and Graph Theory". In 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.
Texto completo da fonteSrinivas, Y. L., e Debasish Dutta. "Blending and Joining Using Cyclides". In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0170.
Texto completo da fonteRelatórios de organizações sobre o assunto "Algebraic automata theory"
Borgwardt, Stefan, e 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.
Texto completo da fonteBorgwardt, Stefan, e 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.
Texto completo da fonteBach, Christian Friis, e Ken Pearson. Implementing Quotas in GTAP Using GEMPACK or How to Linearize an Inequality. GTAP Technical Paper, setembro de 2000. http://dx.doi.org/10.21642/gtap.tp04.
Texto completo da fonte