Log in

Relevant bibliographies by topics / Algebraic automata theory

Contents

Journal articles

Academic literature on the topic 'Algebraic automata theory'

Author: Grafiati

Published: 1 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algebraic automata theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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 o

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

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 e

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!