Gotowa bibliografia na temat „Théorie algébgrique des automates”
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 „Théorie algébgrique des automates”.
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 "Théorie algébgrique des automates"
Nivat, Maurice, i Dominique Perrin. "Ensembles Reconnaissables de Mots Biinfinis". Canadian Journal of Mathematics 38, nr 3 (1.06.1986): 513–37. http://dx.doi.org/10.4153/cjm-1986-025-6.
Pełny tekst źródłaFlorent Koechlin. "Systèmes de fonctions holonomes, application à la théorie des automates". Bulletin 1024, nr 21 (kwiecień 2023): 173–83. http://dx.doi.org/10.48556/sif.1024.21.173.
Pełny tekst źródłaEdo, Eric. "Automorphismes modérés de l'espace affine". Canadian Journal of Mathematics 55, nr 3 (1.06.2003): 533–60. http://dx.doi.org/10.4153/cjm-2003-022-1.
Pełny tekst źródłaMeurisse, Quentin, Isabelle De Smet, Hadrien Mélot, David Laplume, Thomas Brihaye, Cédric Rivière, Emeline Coszach, Jérémy Cenci, Sesil Koutra i Vincent Becue. "Recherche locale et théorie des jeux appliqués à la création de typo-morphologies compactes". SHS Web of Conferences 82 (2020): 03004. http://dx.doi.org/10.1051/shsconf/20208203004.
Pełny tekst źródłaMARGOLIS, S., M. SAPIR i P. WEIL. "CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA". International Journal of Algebra and Computation 11, nr 04 (sierpień 2001): 405–45. http://dx.doi.org/10.1142/s0218196701000498.
Pełny tekst źródłaElizalde, Sergi. "Allowed patterns of β -shifts". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AO,..., Proceedings (1.01.2011). http://dx.doi.org/10.46298/dmtcs.2911.
Pełny tekst źródłaRozprawy doktorskie na temat "Théorie algébgrique des automates"
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
Hélouët, Loïc. "Automates d'ordres : théorie et applications". Habilitation à diriger des recherches, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00926742.
Pełny tekst źródłaBroglio, Annie. "Prédiction par automates". Aix-Marseille 1, 1991. http://www.theses.fr/1991AIX11385.
Pełny tekst źródłaPodelski, Andreas. "Monoïdes d'arbres et automates d'arbres". Paris 7, 1989. http://www.theses.fr/1989PA077247.
Pełny tekst źródłaMosconi, Jean. "La constitution de la théorie des automates". Paris 1, 1989. http://www.theses.fr/1989PA010611.
Pełny tekst źródłaIn the years 1965, the process of the constitution of the "theory of automata", a logico-algebraical study of the computing devices which can be used as mathematical models for information processing machines, was completed. In spite of its theoretical connection with the Turing machine, the enterprise did, however, not take the form of an explicit topic until 1948, when Von Neumann proposed to handle within the framework of a general "logical" theory a whole set of questions stemming from various domains, spreading from biology to computers. The study of finite automata, in the decade 1950-1960, was then the first to impose an organisation on these disconnected achievements in the form of a coherent abstract theory, endowed with manageable algebraical and logical tools. As a counterpart, Turing's approach of calculability gave rise to a theory of infinite machines (whose architectonics was brought gradually closer to that of actual machines), which was to be quickly extended by a computational complexity theory. Finally, in the sixties, joining the combinatorial-algorithmic tradition of post and Markov, the syntactical analysis of natural and programming languages gave the decisive impulse, through the theory of formal grammars, to the study of "bounded-infinite" automata, in particular pushdown and linear bounded automata
Dartois, Luc. "Méthodes algébriques pour la théorie des automates". Paris 7, 2014. http://www.theses.fr/2014PA077236.
Pełny tekst źródłaIn this thesis, we extend the links between the different models of representation of rational languages that are automata, logic and monoids through two extensions of these theories. The first contribution concerns the two-way transducers, an extension of automata defining transformations of words. We first propound the construction of the transitions monoid of two-way machines. This allows us to define the notion of aperiodic two-way transducers. We finally prove that this class is stable by composition. The second contribution concerns logic on finite words. The definability problem of a fragment of logic consists in deciding whether a given regular language can be defined by a formula of the said fragment. We study the decidability of this question when the signature of a fragment is enriched, in our case by predicates handling the modular information of the positions. Thanks to algebraic methods, we were able to gather transfer results to enriched fragments, unifying known results as well as obtaining new ones
Samuelides, Mathias. "Automates d'arbres à jetons". Phd thesis, Université Paris-Diderot - Paris VII, 2007. http://tel.archives-ouvertes.fr/tel-00255024.
Pełny tekst źródłaUne première contribution a été de prouver que les variantes déterministes des deux modèles d'automates d'arbres à jetons sont fermées par complément. Nous donnons alors une nouvelle présentation de la preuve de la caractérisation du modèle fort des automates d'arbres à jetons qui a été établie par Engelfriet et Hoogeboom.
Une autre contribution a été de montrer que les deux modèles d'automates à jetons sont équivalents, que le pouvoir d'expression des automates d'arbres à jetons augmente avec le nombre de jetons et qu'il n'est pas toujours possible de déterminiser un automate d'arbres cheminant même si on s'autorise à ajouter un nombre fixé de jetons.
Une dernière contribution a été de prouver que les problèmes du vide et de l'inclusion sont n-EXPTIME complets pour les classes d'automates à n jetons avec n supérieur à 1.
Oaurdi, Faissal. "Expressions rationnelles et automates réduits". Rouen, 2007. http://www.theses.fr/2007ROUES006.
Pełny tekst źródłaThe general topic of this thesis lies within the scope of the automata theory and turns on the design of efficient algorithms for the problem of conversion of weighted and boolean regular expressions into finite automata having small sizes. We study various types of reduced automata defined from regular expressions : the position automaton, the follow automaton, the c-continuation automaton and the common follows automaton. On the one hand, we give a comparison between the follow automaton and the equation automaton. On the other hand, we describe a new efficient algorithm based on the minimization of an acyclic automaton, for the construction of the equation automaton. We were also interested in the generalization of these automata and their constructions for the weighted regular expressions. We generalize the notion of ZPC structure for the weighted case. We develop two new quadratic algorithms for the problem of the conversion of weighted regular expressions. The first algorithm is based on the extended ZPC structure, allows the construction of the position automaton with multiplicities. The second one, based on the c-continuations, computes the equation automaton with multiplicities. We finally define an extension to the weighted case of the common follows set automaton introduced by Hromckovic et al. We show that this automaton can be obtained in O(nlog2(n)) time where n is the size of the weighted regular expressions
Loraud, Nathalie. "Numérations généralisées, langages et automates". Aix-Marseille 1, 1996. http://www.theses.fr/1996AIX11019.
Pełny tekst źródłaVerma, Kumar Neeraj. "Automates d'arbres bidirectionnels modulo théories équationnelles". Cachan, Ecole normale supérieure, 2003. http://www.theses.fr/2003DENS0027.
Pełny tekst źródłaKsiążki na temat "Théorie algébgrique des automates"
Handbook of automata theory. Berlin, Germany: EMS Press, 2021.
Znajdź pełny tekst źródłaBüchi, J. Richard. Finite automata, their algebras and grammars: Towards a theory of formal expressions. Redaktor Siefkes Dirk. New York: Springer-Verlag, 1989.
Znajdź pełny tekst źródłaFinite automata. Boca Raton: Chapman & Hall/CRC, 2004.
Znajdź pełny tekst źródłaFormal languages and computation: Models and their applications. Boca Raton: Taylor & Francis/CRC Press, 2013.
Znajdź pełny tekst źródła1946-, Börger E., red. Computation theory and logic. Berlin: Springer-Verlag, 1987.
Znajdź pełny tekst źródłaArto, Salomaa, red. Semirings, automata, languages. Berlin: Springer-Verlag, 1986.
Znajdź pełny tekst źródłaEric, Pin Jean, red. Infinite words: Automata, semigroups, logic and games. Amsterdam: Elsevier, 2004.
Znajdź pełny tekst źródła1961-, Kaplan S., i Jouannaud Jean-Pierre, red. Conditional term rewriting systems: 1st international workshop, Orsay, France, July 8-10, 1987 : proceedings. Berlin: Springer-Verlag, 1988.
Znajdź pełny tekst źródłaGraph algebras and automata. New York: Marcel Dekker, 2003.
Znajdź pełny tekst źródłaDíaz, J. Automata, languages and programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004 : proceedings. Berlin: Springer, 2004.
Znajdź pełny tekst źródła