• Home
  • About
  • A Brief History of AI
  • AI-Alerts
  • AI Magazine
  • AAAI Conferences
  • NeurIPS
  • Books
  • Classics

Learning Deterministic Weighted Automata with Queries and Counterexamples

Gail Weiss, Yoav Goldberg, Eran Yahav

Nov-19-2025, 01:19:50 GMT–Neural Information Processing Systems 

WFAs are non-deterministic and so not immediately analogous to RNNs.

  artificial intelligence, machine learning, natural language, (18 more...)

Neural Information Processing Systems

Nov-19-2025, 01:19:50 GMT

Conferences    PDF

Add feedback

  • Country:
    • Europe
      • France (0.04)
      • Germany
        • Baden-Württemberg > Stuttgart Region
          • Stuttgart (0.04)
        • Hamburg (0.04)
      • Sweden > Stockholm
        • Stockholm (0.04)
    • North America
      • Canada (0.04)
      • United States
        • California > Santa Clara County
          • Stanford (0.04)
        • District of Columbia > Washington (0.04)
        • Michigan > Washtenaw County
          • Ann Arbor (0.04)
  • Technology:
    • Information Technology > Artificial Intelligence
      • Machine Learning
        • Neural Networks (0.96)
        • Statistical Learning (0.93)
      • Natural Language (1.00)
      • Representation & Reasoning (1.00)

  • By text
  • By views
  • By concept tags

Site Feedback

© 2026, i2k Connect Inc  ·  All Rights Reserved.
Privacy policy  ·  Terms of use  ·  License  ·  Legal Notices
This is i2kweb version 7.1.0-SNAPSHOT. Logged in as aitopics-guest for 59 more minutes (idle timeout).

Site Feedback

powered by
i2k Connect

aitopics.org uses cookies to deliver the best possible experience. By continuing to use this site, you consent to the use of cookies. Learn more »

Add feedback

Send feedback to help us improve this new enhanced search experience.

Thank You!