Results 21 to 30 of about 1,535,797 (279)
A
Expert Systems, 2021 AbstractDue to the high arithmetic complexity and scalability challenges of deep learning, there is a critical need to shift research focus towards energy efficiency. Tsetlin Machines (TMs) are a recent approach to machine learning (ML) that has demonstrated significantly reduced energy compared to neural networks alike, while providing comparable ...
Kuruge Darshana Abeyrathna +7 more
openaire +3 more sources
Simplifying Nondeterministic Finite Cover Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA '98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
Cezar Câmpeanu
doaj +1 more source
A coalgebraic take on regular and $\omega$-regular behaviours [PDF]
Logical Methods in Computer Science, 2021 We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad.
Tomasz Brengos
doaj +1 more source
State Elimination Ordering Strategies: Some Experimental Results [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case.
Nelma Moreira +2 more
doaj +1 more source
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine [PDF]
, 2004 Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which ...
Harman, M, Hierons, RM
core +7 more sources
Cayley automaton semigroups [PDF]
, 2015 Let S be a semigroup, C(S) the automaton constructed from the right Cayley graph of S with respect to all of S as the generating set and ∑(C(S)) the automaton semigroup constructed from C(S). Such semigroups are termed Cayley automaton semigroups. For
McLeman, Alexander Lewis Andrew
core +2 more sources
Random Deterministic Automata With One Added Transition [PDF]
Logical Methods in Computer ScienceEvery language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states. In this article,
Arnaud Carayol +3 more
doaj +1 more source
Higher-Order Pushdown Systems with Data [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphabet. The new automata recognize languages of data words (instead of normal words), which beside each its letter from a finite alphabet have a data value ...
Paweł Parys
doaj +1 more source
Algebra of Finite Automata as a Mathematical Model of the Digital Twin of Smart Production
Современные информационные технологии и IT-образование, 2022 The article is devoted to the development of the finite automata algebra of a special type DTA (Digital Twin Algebra), designed for mathematical modeling of production digital twins.
Dmitry Gapanovich, Vladimir Sukhomlin
doaj +1 more source
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Моделирование и анализ информационных систем, 2020 Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode.
Vladimir A. Zakharov
doaj +1 more source