English
Related papers

Related papers: Simplest Non-Regular Deterministic Context-Free La…

200 papers

To Rogers (1994) we owe the insight that monadic second order predicate logic with multiple successors (MSO) is well suited in many respects as a realistic formal base for syntactic theorizing. However, the agreeable formal properties of…

cmp-lg · Computer Science 2008-02-03 Uwe Moennich

When solving optimization problems under uncertainty with contextual data, utilizing machine learning to predict the uncertain parameters' values is a popular and effective approach. Decision-focused learning (DFL) aims at learning a…

Machine Learning · Computer Science 2026-01-29 Noah Schutte , Grigorii Veviurko , Krzysztof Postek , Neil Yorke-Smith

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

This paper defines the (first-order) conflict resolution calculus: an extension of the resolution calculus inspired by techniques used in modern SAT-solvers. The resolution inference is restricted to (first-order) unit-propagation and the…

Logic in Computer Science · Computer Science 2016-02-16 John Slaney , Bruno Woltzenlogel Paleo

We consider variations on the following problem: given an NFA M and a pattern p, does there exist an x in L(M) such that p matches x? We consider the restricted problem where M only accepts a finite language. We also consider the variation…

Formal Languages and Automata Theory · Computer Science 2009-06-18 Narad Rampersad , Jeffrey Shallit

This work proposes a simple training-free prompt-free approach to leverage large language models (LLMs) for the Chinese spelling correction (CSC) task, which is totally different from all previous CSC approaches. The key idea is to use an…

Computation and Language · Computer Science 2024-10-08 Houquan Zhou , Zhenghua Li , Bo Zhang , Chen Li , Shaopeng Lai , Ji Zhang , Fei Huang , Min Zhang

Morphological declension, which aims to inflect nouns to indicate number, case and gender, is an important task in natural language processing (NLP). This research proposal seeks to address the degree to which Recurrent Neural Networks…

Computation and Language · Computer Science 2018-10-10 Sina Ahmadi

We propose a general method to break down a main complex task into a set of intermediary easier sub-tasks, which are formulated in natural language as binary questions related to the final target task. Our method allows for representing…

Computation and Language · Computer Science 2024-02-02 Felipe Urrutia , Cristian Buc , Valentin Barriere

Neural network models have been demonstrated to be capable of achieving remarkable performance in sentence and document modeling. Convolutional neural network (CNN) and recurrent neural network (RNN) are two mainstream architectures for…

Computation and Language · Computer Science 2015-12-01 Chunting Zhou , Chonglin Sun , Zhiyuan Liu , Francis C. M. Lau

Decision-Focused Learning (DFL) is an emerging learning paradigm that tackles the task of training a machine learning (ML) model to predict missing parameters of an incomplete optimization problem, where the missing parameters are…

Machine Learning · Computer Science 2025-06-23 Yehya Farhat

Model generalization ability upon incrementally acquiring dynamically updating knowledge from sequentially arriving tasks is crucial to tackle the sensitivity-stability dilemma in Continual Learning (CL). Weight loss landscape sharpness…

Machine Learning · Computer Science 2024-11-04 Ang Bian , Wei Li , Hangjie Yuan , Chengrong Yu , Mang Wang , Zixiang Zhao , Aojun Lu , Pengliang Ji , Tao Feng

We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined…

Logic in Computer Science · Computer Science 2023-03-22 Paul Krogmeier , P. Madhusudan

One of the long-standing goals in optimisation and constraint programming is to describe a problem in natural language and automatically obtain an executable, efficient model. Large language models appear to bring this vision closer,…

Artificial Intelligence · Computer Science 2025-11-20 Alessio Pellegrino , Jacopo Mauro

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular languages on a two-letter alphabet having arbitrary high…

Formal Languages and Automata Theory · Computer Science 2019-11-15 Guillaume Bonfante , Florian Deloup

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an…

Logic · Mathematics 2010-10-18 Maria Monks

We present a novel and well automatable approach to formal verification of programs with underspecified semantics, i.e., a language semantics that leaves open the order of certain evaluations. First, we reduce this problem to…

Programming Languages · Computer Science 2022-02-14 Eduard Kamburjan , Nathan Wasser

Decision-focused learning (DFL) is an emerging paradigm that integrates machine learning (ML) and constrained optimization to enhance decision quality by training ML models in an end-to-end system. This approach shows significant potential…

Machine Learning · Computer Science 2024-09-05 Jayanta Mandi , James Kotary , Senne Berden , Maxime Mulamba , Victor Bucarey , Tias Guns , Ferdinando Fioretto

Neural collapse ($\mathcal{NC}$) is a phenomenon observed in classification tasks where top-layer representations collapse into their class means, which become equinorm, equiangular and aligned with the classifiers. These behaviours --…

Machine Learning · Computer Science 2024-11-27 Robert Wu , Vardan Papyan

Attention, specifically scaled dot-product attention, has proven effective for natural language, but it does not have a mechanism for handling hierarchical patterns of arbitrary nesting depth, which limits its ability to recognize certain…

Computation and Language · Computer Science 2024-01-25 Brian DuSell , David Chiang