Search
Search Results
-
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
We propose a query learning algorithm for constructing a minimal DSFA M that separates given two regular languages...
-
Deterministic Finite-State Machines
This chapter introduces deterministic finite-state machines. In addition, it presents a design recipe for state machines. This chapter also discusses...
-
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
Given a deterministic finite automaton (DFA) A, we present a simple algorithm for constructing four deterministic finite automata that accept the...
-
Nondeterministic Finite Automata
The material in this chapter refines the development in Chap. 13 by restricting attention to finite...
-
Deterministic Finite Automata
The examples of deterministic finite automata in the last chapter were given in the form of simple diagrams, with states drawn as circles and...
-
Learning minimal automata with recurrent neural networks
In this article, we present a novel approach to learning finite automata with the help of recurrent neural networks. Our goal is not only to train a...
-
Mata: A Fast and Simple Finite Automata Library
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in...
-
A Logical Treatment of Finite Automata
We present a sound and complete axiomatization of finite words using matching logic. A unique feature of our axiomatization is that it gives a...
-
Timed Automata Verification and Synthesis via Finite Automata Learning
We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a...
-
Deterministic PDAs
This chapter establishes that nondeterministic pushdown automata are more powerful than deterministic pushdown automata.
-
A Novel Family of Finite Automata for Recognizing and Learning \(\omega \) -Regular Languages
Families of DFAs (FDFAs) have recently been introduced as a new representation of...
-
On the Smallest Synchronizing Terms of Finite Tree Automata
This paper deals with properties of synchronizing terms for finite tree automata, which is a generalization of the synchronization principle of...
-
Succinct Representations for (Non)Deterministic Finite Automata
Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their extension is the...
-
On the number of active states in finite automata
We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active...
-
A Myhill-Nerode Theorem for Finite State Matrix Automata and Finite Matrix Languages
We propose a deterministic version of finite state matrix automaton (DFSMA) which recognizes finite matrix languages (FML). Our main result is a...
-
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
AbstractFinite transducers, two-tape automata, and biautomata are related computational models descended from the concept of finite-state automaton....
-
Obfuscating Finite Automata
We construct a virtual black box and perfect circuit-hiding obfuscator for evasive deterministic finite automata using a matrix encoding scheme with...
-
Existential and Universal Width of Alternating Finite Automata
The existential width of an alternating finite automaton (AFA) A on a string w is, roughly speaking, the number of nondeterministic choices that A...
-
Non-deterministic Finite Automata
Should you take the lemon cake or the crème brûlée? Or, consider a more important decision: you’re lost in the mountains in a blizzard without a GPS,...
-
Learning Deterministic One-Clock Timed Automata via Mutation Testing
In active learning, an equivalence oracle is supposed to answer whether a hypothesis model is equivalent to the system under learning. Its...