Inference for regular bilanguages

摘要

The inference problem for languages is generalized, and a solution to this more general problem of inference for the regular tree languages (or bilanguages) is given, first as recognizers and then as generators (grammars) deduced from them. The solution makes use of the Pair-Quéré notion of homomorphism of binoids and permits the synthesis of a class of inference algorithms, which this paper studies.