Results 21 to 30 of about 3,110 (267)
Quantum Finite Automata and Weighted Automata
J. Autom. Lang. Comb., 2007 10 pages, Preliminary version appears in the Proceedings of ACiD-2005, Texts in Algorithmics series of KCL publications, pp.
M. V. Panduranga Rao, V. Vinay
openaire +4 more sources
Problems on Finite Automata and the Exponential Time Hypothesis
Algorithms, 2017 We study several classical decision problems on finite automata under the (Strong) Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection.
Henning Fernau, Andreas Krebs
doaj +1 more source
IEEE Access, 2023 Additive cellular automata over a finite abelian group are a wide class of cellular automata (CA) that are able to exhibit most of the complex behaviors of general CA and they are often exploited for designing applications in different practical contexts.
Alberto Dennunzio +2 more
doaj +1 more source
Generalized Results on Monoids as Memory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
Özlem Salehi +2 more
doaj +1 more source
On injectivity of quantum finite automata [PDF]
Journal of Computer and System Sciences, 2021 We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of determining if the acceptance probability function of a MO-QFA is injective over all input words, i.e., giving a distinct probability for each input word.
Paul C. Bell, Mika Hirvensalo
openaire +5 more sources
On the Existence of Universal Finite or Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function.
Manfred Kudlek
doaj +1 more source
Finite automata with multiplication
Theoretical Computer Science, 1976 AbstractA finite automaton with multiplication (FAM) is a finite automaton with a register which is capable of holding any positive rational number. The register can be multiplied by any of a fixed number of rationals and can be tested for value 1. Closure properties and decision problems for various types of FAM's (e.g.
Oscar H. Ibarra +2 more
openaire +1 more source
Measuring cones and other thick subsets in free groups [PDF]
International Journal of Group Theory, 2018 In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint union of ...
Elizaveta Frenkel +1 more
doaj +1 more source
To some structural properties of ∞ - languages
Ratio Mathematica, 2022 Properties of catenation of sequences of finite (words) and infinite ( lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices.
Ivan Mezník
doaj +1 more source
Finite automata over algebraic structures: models and some methods of analysis [PDF]
Computer Science Journal of Moldova, 2015 In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given.
Volodymyr V. Skobelev +1 more
doaj