Residuality and Learning for Nondeterministic Nominal Automata

@article{Moerman2022ResidualityAL,
  title={Residuality and Learning for Nondeterministic Nominal Automata},
  author={Joshua Moerman and Matteo Sammartino},
  journal={Log. Methods Comput. Sci.},
  year={2022},
  volume={18}
}
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata. To answer it, we develop the theory of residual nominal automata, a subclass of nondeterministic nominal automata. We prove that this class has canonical representatives, which can always be constructed via a finite number of observations. This… 

Figures from this paper

References

SHOWING 1-10 OF 47 REFERENCES
Bidimensional linear recursive sequences and universality of unambiguous register automata
TLDR
The orbit-counting function satisfies a system of bidimensional linear recursive equations with polynomial coefficients (linrec), which generalises analogous recurrences for the Stirling numbers of the second kind, and it is shown that universality reduces to the zeroness problem for linrec sequences.
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
TLDR
A theory of vector spaces spanned by orbit-finite sets is developed and a decision procedure for equivalence of weighted register automata is given, which are the common generalization of weighted automata and register Automata for infinite alphabets.
To the Best of Our Knowledge
Automata Learning: An Algebraic Approach
TLDR
Using the concept of an automata presentation of T-algebras, it is demonstrated that the task of learning a T-recognizable language can be reduced to learning an abstract form of algebraic automaton whose transitions are modeled by a functor.
Residual Nominal Automata
TLDR
It is shown that nominal automata admit canonical minimal representatives, and that the universality problem becomes decidable, and exact learning of these automata is studied.
Combining Black-Box and White-Box Techniques for Learning Register Automata
TLDR
Some directions for future research on how black-box model learning can be enhanced using white-box information extraction methods are explored, with the aim to maintain the benefits of dynamic black- box methods while making effective use of information that can be obtained through white- box techniques.
Nominal Techniques and Black Box Testing for Automata Learning
Using an adaptation of state-of-the-art algorithms for black-box automata learning, as implemented in the LearnLib tool, we succeeded to learn a model of the Engine Status Manager (ESM), a software
The Containment Problem for Unambiguous Register Automata
TLDR
It is proved that the problem is decidable and upper bounds on the computational complexity in the general case, and when B is restricted to have a fixed number of registers.
On computability and tractability for infinite sets
TLDR
It is shown that, under suitable assumptions on the underlying structure, a programming language called definable while programs captures exactly the computable functions in a complexity class called fixed-dimension polynomial time, which intuitively speaking describesPolynomial computation on hereditarily definable sets.
LOIS: syntax and semantics
We present the semantics of an imperative programming language called LOIS (Looping Over Infinite Sets), which allows iterating through certain infinite sets, in finite time. Our semantics
...
1
2
3
4
5
...