Constructing deterministic finite-state automata in sparse recurrent neural networks

Christian W. Omlin, C. Lee Giles

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We present an algorithm for encoding deterministic finite-state automata in sparse recurrent neural networks with sigmoidal discriminant functions and second-order weights. We prove that for particular weight strength values the regular languages accepted by DFA's and the constructed networks are identical.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Neural Networks - Conference Proceedings
PublisherIEEE
Pages1732-1737
Number of pages6
Volume3
StatePublished - 1994
EventProceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) - Orlando, FL, USA
Duration: Jun 27 1994Jun 29 1994

Other

OtherProceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7)
CityOrlando, FL, USA
Period6/27/946/29/94

Fingerprint

Formal languages
Recurrent neural networks
Finite automata

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Omlin, C. W., & Lee Giles, C. (1994). Constructing deterministic finite-state automata in sparse recurrent neural networks. In IEEE International Conference on Neural Networks - Conference Proceedings (Vol. 3, pp. 1732-1737). IEEE.
Omlin, Christian W. ; Lee Giles, C. / Constructing deterministic finite-state automata in sparse recurrent neural networks. IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 3 IEEE, 1994. pp. 1732-1737
@inproceedings{4782f1295e554596a99cbbde986377de,
title = "Constructing deterministic finite-state automata in sparse recurrent neural networks",
abstract = "We present an algorithm for encoding deterministic finite-state automata in sparse recurrent neural networks with sigmoidal discriminant functions and second-order weights. We prove that for particular weight strength values the regular languages accepted by DFA's and the constructed networks are identical.",
author = "Omlin, {Christian W.} and {Lee Giles}, C.",
year = "1994",
language = "English (US)",
volume = "3",
pages = "1732--1737",
booktitle = "IEEE International Conference on Neural Networks - Conference Proceedings",
publisher = "IEEE",

}

Omlin, CW & Lee Giles, C 1994, Constructing deterministic finite-state automata in sparse recurrent neural networks. in IEEE International Conference on Neural Networks - Conference Proceedings. vol. 3, IEEE, pp. 1732-1737, Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7), Orlando, FL, USA, 6/27/94.

Constructing deterministic finite-state automata in sparse recurrent neural networks. / Omlin, Christian W.; Lee Giles, C.

IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 3 IEEE, 1994. p. 1732-1737.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Constructing deterministic finite-state automata in sparse recurrent neural networks

AU - Omlin, Christian W.

AU - Lee Giles, C.

PY - 1994

Y1 - 1994

N2 - We present an algorithm for encoding deterministic finite-state automata in sparse recurrent neural networks with sigmoidal discriminant functions and second-order weights. We prove that for particular weight strength values the regular languages accepted by DFA's and the constructed networks are identical.

AB - We present an algorithm for encoding deterministic finite-state automata in sparse recurrent neural networks with sigmoidal discriminant functions and second-order weights. We prove that for particular weight strength values the regular languages accepted by DFA's and the constructed networks are identical.

UR - http://www.scopus.com/inward/record.url?scp=0028733199&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028733199&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028733199

VL - 3

SP - 1732

EP - 1737

BT - IEEE International Conference on Neural Networks - Conference Proceedings

PB - IEEE

ER -

Omlin CW, Lee Giles C. Constructing deterministic finite-state automata in sparse recurrent neural networks. In IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 3. IEEE. 1994. p. 1732-1737