Identification of a specific limitation on local-feedback recurrent networks acting as Mealy-Moore machines

Describes a proof which identifies limitations of local-feedback recurrent networks (LFRNs) in representing Mealy-Moore machines. Specifically, the paper identifies a class of machines that are unrepresentable in these networks. While it is known that LFRNs cannot represent all automata, this is the...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on neural networks Vol. 10; no. 2; pp. 433 - 438
Main Author Kremer, S.C.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 1999
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text
ISSN1045-9227
DOI10.1109/72.750574

Cover

Abstract Describes a proof which identifies limitations of local-feedback recurrent networks (LFRNs) in representing Mealy-Moore machines. Specifically, the paper identifies a class of machines that are unrepresentable in these networks. While it is known that LFRNs cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines.
AbstractList This paper describes a proof which identifies limitations of local-feedback recurrent networks (LFRN's) in representing Mealy-Moore machines. Specifically, it identifies a class of machines that are unrepresentable in these networks. While it is known that LFRN's cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines.
Describes a proof which identifies limitations of local-feedback recurrent networks (LFRNs) in representing Mealy-Moore machines. Specifically, the paper identifies a class of machines that are unrepresentable in these networks. While it is known that LFRNs cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines.
This paper describes a proof which identifies limitations of local-feedback recurrent networks (LFRN's) in representing Mealy-Moore machines. Specifically, it identifies a class of machines that are unrepresentable in these networks. While it is known that LFRN's cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines.This paper describes a proof which identifies limitations of local-feedback recurrent networks (LFRN's) in representing Mealy-Moore machines. Specifically, it identifies a class of machines that are unrepresentable in these networks. While it is known that LFRN's cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines.
Describes a proof which identifies limitations of local-feedback recurrent networks (LFRNs) in representing Mealy-Moore machines. Specifically, the paper identifies a class of machines that are unrepresentable in these networks. While it is known that LFRNs cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines
Author Kremer, S.C.
Author_xml – sequence: 1
  givenname: S.C.
  surname: Kremer
  fullname: Kremer, S.C.
  organization: Dept. of Comput. & Inf. Sci., Guelph Univ., Ont., Canada
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1733848$$DView record in Pascal Francis
https://www.ncbi.nlm.nih.gov/pubmed/18252541$$D View this record in MEDLINE/PubMed
BookMark eNqF0jtvFDEQAGAXQeQBBS0FcoGIKDbxc-0tUQQhUiIaqK053xjM7dqHvSeUf49PtwQJIVJZsr-ZsWbmlBylnJCQF5xdcM6GSyMujGbaqCNywpnS3SCEOSantX5njCvN-qfkmFuhhVb8hGxu1pjmGKKHOeZEc6BA6xb9_oqOcYrz8pDomD2MXUBcr8BvaEG_K6VF04Tzz1w2lYKfY_pKodI7hPG-u8u5IJ3Af4sJ6zPyJMBY8flynpEvH95_vvrY3X66vrl6d9t5zYe5C4aFngUOSnpQILxZKSZ0z73UtucSlQYrsFfBSyugGcOV4MxaPwSmjDwj54e825J_7LDOborV4zhCwryrbuDD0Hol-aPSSClkq62bfPNfKVpHmR2Gx2Hfygu2h68WuFtNuHbbEico9-73bBp4vQCorfGhQPKx_nHtc1bZxi4PzJdca8Hg_DKzuUAcHWduvxjOCHdYjBbx9q-Ih5z_sC8PNiLig1sefwFpDcAe
CODEN ITNNEP
CitedBy_id crossref_primary_10_1162_089976601300014538
crossref_primary_10_1016_S0893_6080_03_00054_6
Cites_doi 10.1162/neco.1992.4.1.120
10.1109/72.548181
10.1109/72.508949
10.1080/09540099208946601
10.1145/130385.130432
10.1002/j.1538-7305.1955.tb03788.x
10.1145/103516.103523
10.1515/9781400882618-006
10.1109/72.286928
10.1109/72.536316
10.1109/69.382304
10.1109/72.392262
10.1109/72.392247
10.1109/72.279187
ContentType Journal Article
Copyright 1999 INIST-CNRS
Copyright_xml – notice: 1999 INIST-CNRS
DBID RIA
RIE
AAYXX
CITATION
IQODW
NPM
7SC
8FD
JQ2
L7M
L~C
L~D
7X8
7SP
F28
FR3
DOI 10.1109/72.750574
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Pascal-Francis
PubMed
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
Electronics & Communications Abstracts
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
PubMed
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Computer and Information Systems Abstracts

MEDLINE - Academic
Technology Research Database
Computer and Information Systems Abstracts
PubMed
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Anatomy & Physiology
Computer Science
Applied Sciences
Architecture
EndPage 438
ExternalDocumentID 18252541
1733848
10_1109_72_750574
750574
Genre Journal Article
GroupedDBID ---
-~X
.DC
0R~
29I
4.4
53G
5GY
5VS
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFS
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
S10
TAE
TN5
VH1
AAYOK
AAYXX
CITATION
RIG
IQODW
NPM
7SC
8FD
JQ2
L7M
L~C
L~D
7X8
7SP
F28
FR3
ID FETCH-LOGICAL-c519t-f70f60f1a43ca4a2c7b402561c358613e45a82e64fc382aca471421088c9f0473
IEDL.DBID RIE
ISSN 1045-9227
IngestDate Sun Aug 24 03:20:13 EDT 2025
Thu Sep 04 19:03:36 EDT 2025
Fri Sep 05 04:30:00 EDT 2025
Thu Sep 04 18:35:33 EDT 2025
Thu Apr 03 06:58:34 EDT 2025
Mon Jul 21 09:17:33 EDT 2025
Thu Apr 24 22:51:58 EDT 2025
Tue Jul 01 02:44:28 EDT 2025
Tue Aug 26 21:00:24 EDT 2025
IsPeerReviewed false
IsScholarly false
Issue 2
Keywords Finite state machine
Network architecture
Identification
Mealy-Moore machine
Neural network
Dynamical system
Learning algorithm
Computing machine
Recurrent neuronal network
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c519t-f70f60f1a43ca4a2c7b402561c358613e45a82e64fc382aca471421088c9f0473
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
PMID 18252541
PQID 26919209
PQPubID 23500
PageCount 6
ParticipantIDs ieee_primary_750574
pascalfrancis_primary_1733848
proquest_miscellaneous_26919209
crossref_citationtrail_10_1109_72_750574
crossref_primary_10_1109_72_750574
proquest_miscellaneous_733230255
proquest_miscellaneous_28250899
pubmed_primary_18252541
proquest_miscellaneous_919911031
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 1999-00-00
PublicationDateYYYYMMDD 1999-01-01
PublicationDate_xml – year: 1999
  text: 1999-00-00
PublicationDecade 1990
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: United States
PublicationTitle IEEE transactions on neural networks
PublicationTitleAbbrev TNN
PublicationTitleAlternate IEEE Trans Neural Netw
PublicationYear 1999
Publisher IEEE
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
References ref13
kremer (ref15) 1996
ref14
ref11
hopcroft (ref12) 1979
fahlman (ref9) 1991
ref2
ref1
ref17
ref16
ref18
ref8
ref7
ref4
horne (ref10) 1995
ref6
ref5
moore (ref3) 1956
References_xml – ident: ref11
  doi: 10.1162/neco.1992.4.1.120
– ident: ref1
  doi: 10.1109/72.548181
– ident: ref14
  doi: 10.1109/72.508949
– ident: ref17
  doi: 10.1080/09540099208946601
– ident: ref8
  doi: 10.1145/130385.130432
– ident: ref2
  doi: 10.1002/j.1538-7305.1955.tb03788.x
– ident: ref6
  doi: 10.1145/103516.103523
– start-page: 129
  year: 1956
  ident: ref3
  article-title: gedanken experiments on sequential machines
  publication-title: Automata Studies
  doi: 10.1515/9781400882618-006
– ident: ref7
  doi: 10.1109/72.286928
– start-page: 697
  year: 1995
  ident: ref10
  article-title: an experimental comparison of recurrent neural networks
  publication-title: Advances in Neural Inform Processing Syst 7
– ident: ref18
  doi: 10.1109/72.536316
– year: 1979
  ident: ref12
  publication-title: Introduction to Automata Theory Languages and Computation
– start-page: 612
  year: 1996
  ident: ref15
  article-title: finite-state automata that recurrent cascade-correlation cannot represent
  publication-title: Advances in Neural Information Processing Systems 8
– ident: ref5
  doi: 10.1109/69.382304
– ident: ref4
  doi: 10.1109/72.392262
– ident: ref13
  doi: 10.1109/72.392247
– year: 1991
  ident: ref9
  publication-title: The recurrent cascade-correlation architecture
– ident: ref16
  doi: 10.1109/72.279187
SSID ssj0014506
Score 1.2776796
Snippet Describes a proof which identifies limitations of local-feedback recurrent networks (LFRNs) in representing Mealy-Moore machines. Specifically, the paper...
This paper describes a proof which identifies limitations of local-feedback recurrent networks (LFRN's) in representing Mealy-Moore machines. Specifically, it...
SourceID proquest
pubmed
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 433
SubjectTerms Activation
Applied sciences
Architecture
Automata
Automation
Computation
Computer architecture
Computer networks
Councils
Electric, optical and optoelectronic circuits
Electronics
Exact sciences and technology
Gradient methods
Information science
Logistics
Mathematical analysis
Mathematical models
Networks
Neural networks
Neurofeedback
Robustness
State feedback
Title Identification of a specific limitation on local-feedback recurrent networks acting as Mealy-Moore machines
URI https://ieeexplore.ieee.org/document/750574
https://www.ncbi.nlm.nih.gov/pubmed/18252541
https://www.proquest.com/docview/26919209
https://www.proquest.com/docview/28250899
https://www.proquest.com/docview/733230255
https://www.proquest.com/docview/919911031
Volume 10
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB4VTu2hlKWPtNBaVVX14iVx7Dg5IgRClbanInGLbGP3sJBUZPdAf31n7OxSEIt6i5zJY5Kx5ps3wBeDBlqlSs3zUAqOGrrhtmosV_6ycFoH1NBU7zz7UZ2dy-8X6mLssx1rYbz3MfnMT-kwxvIve7ckV9mhJjQtt2ALpSyVaq0DBlLFMZpoXCjeCKHHJkJF3hxqMU0X3lM9cZYKZUKaAT9GSFMsNsPMqG5Od1Id9xC7FFKWyXy6XNip-_Ogh-N_cvIKXo6wkx0lOdmFZ76bwN5Rhyb39S37ymIiaPSwT2BnNemBjRt_Ai_-aVu4B_NU3RtGdx_rAzOMSjZpiV1RydR4omNRV_KAOtIaN2c35N6nhlCsS_nnA6PKiu4XMwObIWi95bMemWHXMcnTD6_h_PTk5_EZH4c2cIdgcMGDzkOVh8LI0hlphNNWEq4qXKlqxA5eKlMLX8ngyloYpNGFRLuzrl0TcqnLN7Dd9Z1_B6wwqhQ-WGm8QLuqsNbXtXGCIpc6KJXBt9X_bN3IGQ3WuGqjZZM3rRZt-tIZfF6T_k5tPB4jmtCfWhOsVg_uycjd9RrNe1ln8GklMy1uTYq3mM73y6EVVYP4OW-eoED7nOKuGbANFPgMNBIFMbuJpKHsNZrWkcHbJLJ3r4j3F0oW7x_l7AM8T00oyKG0D9uLm6U_QIi1sB_j5voLyFUkig
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB5BOQAHClsegZZaCCEu3iaOHSfHqqJaoNtTK_UWOa7NYdsENbuH8uuZsbNbWnVRb6vs5DGJrfm-eQJ8NkjQCpVrnvpccLTQFW-KquHKnWdWa48Wmuqdp8fF5FT-OFNnQ5_tUAvjnAvJZ25MP0Ms_7yzC3KV7WlC0_IxPEGzL1Us1lqFDKQKgzSRXiheCaGHNkJZWu1pMY6n3jI-YZoK5UKaHl-Hj3Ms1gPNYHAON2Mldx_6FFKeyWy8mDdj--dOF8cH6vISXgzAk-3HlfIKHrl2BFv7LZLuy2v2hYVU0OBjH8HmctYDG7b-CJ7_07hwC2axvtcPDj_WeWYYFW3SIXZBRVPDHy0L1pJ7tJKNsTN2RQ5-agnF2piB3jOqrWh_MdOzKcLWaz7tUBl2GdI8Xf8aTg-_nRxM-DC2gVuEg3PudeqL1GdG5tZII6xuJCGrzOaqRPTgpDKlcIX0Ni-FQRmdSWSeZWkrn0qdv4GNtmvdO2CZUblwvpHGCWRWWdO4sjRWUOxSe6US-Lr8nrUdNKPRGhd14DZpVWtRxzedwKeV6O_YyOM-oRF9qZXA8ujOrTVyc75Ggi_LBHaXa6bGzUkRF9O6btHXoqgQQafVfySQoVPkNQG2RgLvgTRRkLLrRCrKX6N5HQm8jUv25hHx-kLJ7P29mu3C08nJ9Kg--n788wM8iy0pyL20DRvzq4XbQcA1bz6GjfYXLDEn1w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Identification+of+a+specific+limitation+on+local-feedback+recurrent+networks+acting+as+Mealy-Moore+machines&rft.jtitle=IEEE+transactions+on+neural+networks&rft.au=Kremer%2C+Stefan+C&rft.date=1999&rft.issn=1045-9227&rft.volume=10&rft.issue=2&rft.spage=433&rft.epage=438&rft_id=info:doi/10.1109%2F72.750574&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9227&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9227&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9227&client=summon