Abstract: Single Flux Quantum (SFQ) circuits provide ultrafast operation and low power consumption, making them attractive candidates for machine learning accelerators. The Tsetlin Machine (TM) is a ...

A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and an abstract machine that can be in exactly one of a finite number of ...

The goal of a machine learning binary classification problem is to predict a variable that has exactly two possible values. For example, you might want to predict the sex of a company employee (male = ...

ABSTRACT: In recent decades, the impact of climate change on natural resources has increased. However, the main challenges associated with the collection of meteorological data include the presence of ...

ABSTRACT: The paper continues the research on algorithms for generating nondeterministic finite automata possessing the following property (the so-called walibad property): among their covering ...

Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions and languages over finite words.

Abstract: Finite State Automata (FSA) serve as a fundamental mathematical model of computation, commonly explored in computer science degree programs. Traditionally, FSA are represented through state ...