Results 41 to 50 of about 14,469 (313)
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
, 2011 What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core +1 more source
Testing the Equivalence of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al.
Marco Almeida +2 more
doaj +1 more source
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
KAMINSKI, M., FRANCEZ, N.
openaire +1 more source
FINITE AUTOMATA WITH ADVICE TAPES [PDF]
International Journal of Foundations of Computer Science, 2013 We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum.
Ugur Küçük +2 more
openaire +2 more sources
Deciding the value 1 problem for probabilistic leaktight automata [PDF]
Logical Methods in Computer Science, 2015 The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1?
Nathanaël Fijalkow +3 more
doaj +1 more source
An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials
Advanced Engineering Materials, EarlyView.An entire workflow for the high‐throughput characterization and analysis of compositionally graded magnetic films is presented. Characterization protocols, data management tools and data analysis approaches are illustrated with test case Sm(Fe, V)12 based films.
William Rigaut +16 more
wiley +1 more source
ON THE PROBLEM OF LOGIC-AUTOMATIC FORMULAS PERFORMABILITY
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2020 Background. In the theory of finite automata, there are a number of ways to define finite automata (finitely automatic functions). There are systems of canonical equations among them, Moore diagrams, information trees, schemes of automatic elements ...
S. S. Marchenkov
doaj +1 more source
Can Nondeterminism Help Complementation? [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Yang Cai, Ting Zhang
doaj +1 more source
Enumeration of finite automata
Information and Control, 1967 Harary ( 1960, 1964), in a survey of 27 unsolved problems in graphical enumeration, asked for the number of different finite automata. Recently, Harrison (1965) solved this problem, but without considering automata with initial and final states. With the aid of the Power Group Enumeration Theorem (Harary and Palmer, 1965, 1966) the entire problem can ...
Harary, Frank, Palmer, Edgar M.
openaire +2 more sources