Charles Explorer logo
🇬🇧

Restarting Automata Inference Complexity

Publication

Abstract

To find a model consistent with given input data is a common problem solved in several fields. We are concerned with models of languages.

The complexity of a search for a suitable model of some target language based on given samples is established in this article.