regular language

A Regex Minimization Benchmark: A PSPACE-Complete Challenge for Language Models EACL 2026 First-Order Automata AAAI 2025 Implicit Language Models are RNNs: Balancing Parallelization and Expressivity ICML 2025 Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory ICLR 2025 On the Expressiveness and Length Generalization of Selective State Space Models on Regular Languages AAAI 2025 Advancing Regular Language Reasoning in Linear Recurrent Neural Networks NAACL 2024 Angluin-Style Learning of Deterministic Büchi and Co-Büchi Automata IJCAI 2024 Assume-Guarantee Reinforcement Learning AAAI 2024 In-Context Language Learning: Architectures and Algorithms ICML 2024 Lower Bounds on the Expressivity of Recurrent Neural Language Models NAACL 2024 MLRegTest: A Benchmark for the Machine Learning of Regular Languages JMLR 2024 On Efficiently Representing Regular Languages as RNNs ACL 2024 On the Expressivity of Recurrent Neural Cascades AAAI 2024 The Expressive Power of Transformers with Chain of Thought ICLR 2024 What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages ACL 2024 On the Intersection of Context-Free and Regular Languages EACL 2023 Transformer Working Memory Enables Regular Language Reasoning And Natural Language Length Extrapolation EMNLP 2023 Constraining Linear-chain CRFs to Regular Languages ICLR 2022 Understanding Robust Generalization in Learning Regular Languages ICML 2022 Simple induction of (deterministic) probabilistic finite-state automata for phonotactics by stochastic gradient descent ACL 2021 Bounds in query learning COLT 2020 On the Ability and Limitations of Transformers to Recognize Formal Languages EMNLP 2020 Regular Boardgames AAAI 2019 Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks ICLR 2019 Learning Shuffle Ideals Under Restricted Distributions NeurIPS 2014