Abstract
We investigate the learning problem of unary output two-tape non deterministic finite automata (unary output 2-tape NFAs) from multiplicity and equivalence queries. Given an alphabet A and a unary alphabet x, a unary output 2-tape NFA accepts a subset of AA *xx *. In [6] Bergadano and Varricchio proved that the behavior of an unknown automaton with multiplicity in a field K (K-automaton) is exactly identifiable when multiplicity and equivalence queries are allowed. In this paper multiplicity automata are used to prove the learnability of unary output 2-tape NFA’s. We shall identify the behavior of a unary output 2-tape NFA using an automaton with multiplicity in K rat 〈〈x〉〉. We provide an algorithm which is polynomial in the size of this automaton.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin and Carl H. Smith, Inductive Inference: Theory and Metods, Computing Surveys, 15 (1983) pp. 237–269.
D. Angluin, Learning regular sets from queries and counterexamples, Information and Computation, 75 (1987), pp.87–106.
D. Angluin, Queries and concept learning, Machine Learning, 2 (1988), pp.319–342.
D. Angluin, Computational Learning Theory: Survey and Selected Bibliography, proceedings of the 24th ACM Symposium on the Theory of Computing (STOC 92), pp.351–369.
A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz and S. Varricchio, On the Applications of Multiplicity Automata in Learning, 37th Annual Symposium on Foundations of Computer Science, (1996), pp.349–358.
F. Bergadano and S. Varricchio, Learning Behaviors of automata from Multiplicity and Equivalence Queries SIAM J. On Computing, 25 (1996), pp.1268–1280.
F. Bergadano, N. H. Bshouty, C. Tamon and S. Varricchio, On Learning Branching Programs and Small Depth Circuits Lectures Notes in Artififial Intelligence, 1208 (1997), pp.150–161.
F. Bergadano, D. Catalano and S. Varricchio, Learning Sat-k-DNF Formulas from Membership Queries, proceedings of the 28th ACM Symposium on the Theory of Computing (STOC 96), pp.126–131.
J. Berstel, Trasductions and Languages context-free, Stuttgard: Teubner, 1979.
J. Berstel and C. Reutenauer, Rational series and their languages, Springer-Verlag, Berlin, 1988.
S. Eilenberg, Semirings, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
T. Harju and J. Karhumaki, The equivalence problem of multi-tape finite automata, Theoretical Computer Science, 78 (1991), pp.347–355.
O. Ibarra, Reversal-Bounded Multicounter Machines and their Decisions Problems, J. Assoc. Comp. Machinery, 25 (1978), pp.116–133. 88
W. Kuich and A. Salomaa, Semirings, Automata, Languages, Springer-Verlag, Berlin.
M. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop., 3 (1959), pp.114–125. 88
A. Salomaa and M. Soittola Automata theoretic aspects of formal power series, Springer-Verlag, New York, 1978.
L.G. Valiant, A theory of the learnable, Communications of the ACM. 27(11) (1984), pp.1134–1142.
T. Yokomori, Learning Two-Tape Automata from Queries and Counterexamples, Mathematical Systems Theory, 29(3) (1996), pp.259–270.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melideo, G., Varricchio, S. (1998). Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 1998. Lecture Notes in Computer Science(), vol 1501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49730-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-49730-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65013-3
Online ISBN: 978-3-540-49730-1
eBook Packages: Springer Book Archive