Identifying unrecognizable regular languages by queries
We describe a new technique useful in identifying a subclass of regular trace languages (defined on a free partially commutative monoid). We extend an algorithm defined by Dana Angluin in 1987 for DFA's and using equivalence and membership queries. In trace languages the words are equivalence classes of strings, and we show how to extract, from a given class, a string that can drive the original learning algorithm. In this way we can identify a class of regular trace languages which includes languages which are not recognizable by any automaton.
- [BR87]P. Berman, R. Roos. Learning one-counter languages in polynomial time. In Proc. of the Symp. on Found. of Comp. Sci., 61-1987.Google Scholar
- [Ma85]A. Mazurkiewicz. Semantics of concurrent systems: A modular fixed point trace approach. Lect. Notes in Comp. Sci., vol. 188, 353-, Springer-Verlag, 1985.Google Scholar
- [Sa90]Y. Sakakibara. Inductive inference of logic programs based on algebraic semantics. New Generation Computing, 7:365-, 1990.Google Scholar