Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Dewdney, A. K., Ott, T. J. 1991. Efficient Simulation of Finite Automata by Neural Nets. Journal of ACM, 38, 495–514.
Indyk, P. 1995. Optimal Simulation of Automata by Neural Nets. Proc. of the 12th Annual Symposium on Theoretical Aspects of Computer Science STACS'95 LNCS 900, 337–348.
Orponen, P. 1994. Computational Complexity of Neural Networks: A Survey. Nordic Journal of Computing, 1, 94–110.
Parberry, I. 1994. Circuit Complexity and Neural Networks. The MIT Press, Cambridge, Massachusetts.
Šíma, J., Wiedermann, J. 1995. Neural Language Acceptors. To appear in Proc. of the Second International Conference Developments in Language Theory, Magdeburg, World Scientific Publishing Co., Singapore.
Wiedermann, J. 1994. Complexity Issues in Discrete Neurocomputing. Neural Network World, 4, 99–119.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Šíma, J. (1995). Hopfleid languages. In: Bartosek, M., Staudek, J., Wiedermann, J. (eds) SOFSEM '95: Theory and Practice of Informatics. SOFSEM 1995. Lecture Notes in Computer Science, vol 1012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60609-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-60609-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60609-3
Online ISBN: 978-3-540-48463-9
eBook Packages: Springer Book Archive