conftrace_
← Foundations
Computer Science › Foundations ›

Formal Languages

113 papers

Papers per year

1
13
7
'15
'20
'25

Papers

Description Logics with Two Types of Definite Descriptions: Complexity, Expressiveness, and Automated Deduction AAAI 2026
An Information-Theoretic Foundation for the Subregular Hierarchy ACL 2026
Prefix Parsing is Just Parsing ACL 2026
On the Hardness of Learning Regular Expressions ALT 2026
Symbolic Functional Decomposition: A Reconfiguration Approach AAAI 2025
First-Order Automata AAAI 2025
An Expert System for Danish Traffic Law Cases (Student Abstract) AAAI 2025
Unique Hard Attention: A Tale of Two Sides ACL 2025
Harmonizing Annotation of Turkic Postverbial Constructions: A Comparative Study of UD Treebanks COLING 2025
Automated Strategy Invention for Confluence of Term Rewrite Systems IJCAI 2025
Basilisk: Using Provenance Invariants to Automate Proofs of Undecidable Protocols OSDI 2025
The Expressive Capacity of State Space Models: A Formal Language Perspective NIPS 2024
Using Symmetries to Lift Satisfiability Checking AAAI 2024
An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes AAAI 2024
Submodel Enumeration for CTL Is Hard AAAI 2024
Linear-Time Verification of Data-Aware Processes Modulo Theories via Covers and Automata AAAI 2024
A Compiler for Weak Decomposable Negation Normal Form AAAI 2024
Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond) AAAI 2024
Learning Broadcast Protocols AAAI 2024
Decompositions in Compositional Translation of LTLf to DFA (Student Abstract) AAAI 2024
Selene: Pioneering Automated Proof in Software Verification ACL 2024
PyFoma: a Python finite-state compiler module ACL 2024
Building a Broad Infrastructure for Uniform Meaning Representations COLING 2024
Eesthetic: A Paralex Lexicon of Estonian Paradigms COLING 2024
An L* Algorithm for Deterministic Weighted Regular Languages EMNLP 2024