Bibliografías temáticas / Algebraic automata theory

Índice

  1. Artículos de revistas

Literatura académica sobre el tema "Algebraic automata theory"

Autor: Grafiati
Publicado: 1 de junio de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Algebraic automata theory".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Algebraic automata theory"

1

Pal, Priyanka, S. P. Tiwari, and Renu Verma. "Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices." New Mathematics and Natural Computation 15, no. 01 (2018): 169–90. http://dx.doi.org/10.1142/s1793005719500108.

Texto completo
Resumen
This paper is towards the algebraic and topological study of automata based on residuated and co-residuated lattices via different operators. The interrelationships among the operators are discussed. Interestingly, we show that the algebraic concepts of an automaton based on a residuated and co-residuated lattice can be expressed in terms of [Formula: see text]-topology/co-topology induced by operators. Finally, a composition of such automata is introduced and its categorical significance is discussed.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Chilton, Chris, Bengt Jonsson, and Marta Kwiatkowska. "An algebraic theory of interface automata." Theoretical Computer Science 549 (September 2014): 146–74. http://dx.doi.org/10.1016/j.tcs.2014.07.018.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Cadilhac, Michaël, Andreas Krebs, and Pierre McKenzie. "The Algebraic Theory of Parikh Automata." Theory of Computing Systems 62, no. 5 (2017): 1241–68. http://dx.doi.org/10.1007/s00224-017-9817-2.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

van Heerdt, Gerco, Joshua Moerman, Matteo Sammartino, and Alexandra Silva. "A (co)algebraic theory of succinct automata." Journal of Logical and Algebraic Methods in Programming 105 (June 2019): 112–25. http://dx.doi.org/10.1016/j.jlamp.2019.02.008.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Novák, Michal, Štepán Křehlík, and Kyriakos Ovaliadis. "Elements of Hyperstructure Theory in UWSN Design and Data Aggregation." Symmetry 11, no. 6 (2019): 734. http://dx.doi.org/10.3390/sym11060734.

Texto completo
Resumen
In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, E L -hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

ANTIĆ, CHRISTIAN. "On Cascade Products of Answer Set Programs." Theory and Practice of Logic Programming 14, no. 4-5 (2014): 711–23. http://dx.doi.org/10.1017/s1471068414000301.

Texto completo
Resumen
AbstractDescribing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or “emulated”) by a cascade product of very simple automata. This led to an elegant algebraic theory of automata based on finite semigroups (Krohn-Rhodes Theory). Surprisingly, by relating logic programs and automata, we can show in this paper that the Krohn-Rhodes Theory is applicable in Answer Set Programming (ASP). More precisely, we recast the concept of a cascade product to ASP, and prove that every program can be represented by a product of very simple programs, the reset and standard programs. Roughly, this implies that the reset and standard programs are the basic building blocks of ASP with respect to the cascade product. In a broader sense, this paper is a first step towards an algebraic theory of products and networks of nonmonotonic reasoning systems based on Krohn-Rhodes Theory, aiming at important open issues in ASP and AI in general.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Derksen, Harm, Emmanuel Jeandel, and Pascal Koiran. "Quantum automata and algebraic groups." Journal of Symbolic Computation 39, no. 3-4 (2005): 357–71. http://dx.doi.org/10.1016/j.jsc.2004.11.008.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Ambainis, Andris, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, and Denis Therien. "Algebraic Results on Quantum Automata." Theory of Computing Systems 39, no. 1 (2005): 165–88. http://dx.doi.org/10.1007/s00224-005-1263-x.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Pal, Priyanka, S. P. Tiwari, and J. Kavikumar. "Measure of Operators Associated with Fuzzy Automata." New Mathematics and Natural Computation 16, no. 01 (2020): 17–35. http://dx.doi.org/10.1142/s1793005720500027.

Texto completo
Resumen
This paper is toward the study of measure of different operators in fuzzy automata theory, which determine the amount of preciseness of given [Formula: see text]-valued subset endowed with an [Formula: see text]-valued preorder induced by [Formula: see text]-valued transition function of an [Formula: see text]-valued automaton. Further, we study the algebraic and topological study of [Formula: see text]-valued automata via different [Formula: see text]-valued operators and on the basis of homomorphism we examine the behavior of operators associated with an [Formula: see text]-valued automaton.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

LE SAEC, BERTRAND, JEAN-ERIC PIN, and PASCAL WEIL. "SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY." International Journal of Algebra and Computation 01, no. 03 (1991): 291–314. http://dx.doi.org/10.1142/s0218196791000195.

Texto completo
Resumen
Nous prouvons que tout semigroupe fini est quotient d'un semigroupe fini dans lequel les stabilisateurs droits satisfont les identités x = x2 et xy = xyx. Ce resultat a plusieurs consé-quences. Tout d'abord, nous l'utilisons, en même temps qu'un résultat de I. Simon sur les congruences de chemins, pour obtenir une preuve purement algébrique d'un théorème profond de McNaughton sur les mots infinis. Puis, nous donnons une preuve algébrique d'un théorème de Brown sur des conditions de finitude pour les semigroupes. We show that every finite semigroup is a quotient of a finite semigroup in which every right stabilizer satisfies the identities x = x2 and xy = xyx. This result has several consequences. We first use it together with a result of I. Simon on congruences on paths to obtain a purely algebraic proof of a deep theorem of McNaughton on infinite words. Next, we give an algebraic proof of a theorem of Brown on a finiteness condition for semigroups.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes
También puede estar interesado en las bibliografías ampliadas sobre el tema "Algebraic automata theory" para tipos de fuentes particulares:
Artículos de revistas
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía