ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2004.00478
  4. Cited By
Distance and Equivalence between Finite State Machines and Recurrent
  Neural Networks: Computational results

Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results

1 April 2020
Reda Marzouk
C. D. L. Higuera
ArXiv (abs)PDFHTML

Papers citing "Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results"

4 / 4 papers shown
Extracting Weighted Automata for Approximate Minimization in Language
  Modelling
Extracting Weighted Automata for Approximate Minimization in Language ModellingInternational Conference on Graphics and Interaction (GI), 2021
Clara Lacroce
Prakash Panangaden
Guillaume Rabusseau
325
8
0
05 Jun 2021
Formal Language Theory Meets Modern NLP
Formal Language Theory Meets Modern NLP
William Merrill
AI4CENAI
438
17
0
19 Feb 2021
Distillation of Weighted Automata from Recurrent Neural Networks using a
  Spectral Approach
Distillation of Weighted Automata from Recurrent Neural Networks using a Spectral ApproachMachine-mediated learning (ML), 2020
Rémi Eyraud
Stéphane Ayache
223
19
0
28 Sep 2020
On Computability, Learnability and Extractability of Finite State
  Machines from Recurrent Neural Networks
On Computability, Learnability and Extractability of Finite State Machines from Recurrent Neural Networks
Reda Marzouk
218
2
0
10 Sep 2020
1
Page 1 of 1