← Foundations
Computer Science › Foundations ›

Formal Languages

110 directly classified papers

Papers per year

Papers

A General Notion of Equivalence for Abstract Argumentation IJCAI 2017
Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints IJCAI 2017
Symbolic LTLf Synthesis IJCAI 2017
Low-Rank Approximation of Weighted Tree Automata AISTATS 2016
Querying Data Graphs with Arithmetical Regular Expressions IJCAI 2016
Learning to Identify Concise Regular Expressions that Describe Email Campaigns JMLR 2015
Unsupervised Structure Learning of Stochastic And-Or Grammars NIPS 2013
Learning and Model-Checking Networks of I/O Automata ACML 2012
Spectral Learning of General Weighted Automata via Constrained Matrix Completion NIPS 2012
Learning Balls of Strings from Edit Corrections JMLR 2008