English
Related papers

Related papers: A Note on Undecidability of Observation Consistenc…

200 papers

A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…

Formal Languages and Automata Theory · Computer Science 2016-11-22 Giovanna J. Lavado , Giovanni Pighizzini , Luca Prigioniero

A common assumption in causal inference from observational data is that there is no hidden confounding. Yet it is, in general, impossible to verify this assumption from a single dataset. Under the assumption of independent causal mechanisms…

Methodology · Statistics 2023-11-07 Rickard K. A. Karlsson , Jesse H. Krijthe

We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Joshua Moerman , Matteo Sammartino

Syntax is a latent hierarchical structure which underpins the robust and compositional nature of human language. In this work, we explore the hypothesis that syntactic dependencies can be represented in language model attention…

Computation and Language · Computer Science 2023-10-24 Jasper Jian , Siva Reddy

We consider a sequence of independent random variables with the known distribution observed sequentially. The observation $n$ is assumed to be a value of one order statistics such as s:n-th, where 1 is less than s is less than n. It the…

Optimization and Control · Mathematics 2020-11-17 Zdzisław Porosiński , Marek Skarupski , Krzysztof Szajowski

Large language models have shown unprecedented abilities in generating linguistically coherent and syntactically correct natural language output. However, they often return incorrect and inconsistent answers to input questions. Due to the…

Databases · Computer Science 2023-12-27 Jasmin Mousavi , Arash Termehchy

We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.

chao-dyn · Physics 2008-02-03 Karl Svozil

The problem of \emph{regular separability} asks, given two languages $K$ and $L$, whether there exists a regular language $S$ with $K\subseteq S$ and $S\cap L=\emptyset$. This problem has recently been studied for various classes of…

Formal Languages and Automata Theory · Computer Science 2019-08-13 Ramanathan S. Thinniyam , Georg Zetzsche

Language technologies that accurately model the dynamics of events must perform commonsense reasoning. Existing work evaluating commonsense reasoning focuses on making inferences about common, everyday situations. To instead investigate the…

Computation and Language · Computer Science 2024-05-02 Wenting Zhao , Justin T Chiu , Jena D. Hwang , Faeze Brahman , Jack Hessel , Sanjiban Choudhury , Yejin Choi , Xiang Lorraine Li , Alane Suhr

In this paper it is showed that if a time-varying uncertain system is robustly completely detectable then there exists an estimator for this system, i.e. we can estimate asymptotically the state vector of the system. Moreover, if a…

Optimization and Control · Mathematics 2007-05-23 Iasson Karafyllis , Costas Kravaris

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

Artificial Intelligence · Computer Science 2024-12-16 Nico Roos

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Logic in Computer Science · Computer Science 2007-05-23 Jørgen Villadsen

The problem of finite/fixed-time cooperative state estimation is considered for a class of quasilinear systems with nonlinearities satisfying a H\"older condition. A strongly connected nonlinear distributed observer is designed under the…

Optimization and Control · Mathematics 2024-07-09 Min Li , Andrey Polyakov , Siyuan Wang , Gang Zheng

We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…

Programming Languages · Computer Science 2020-07-24 Paul Krogmeier , Umang Mathur , Adithya Murali , P. Madhusudan , Mahesh Viswanathan

This paper addresses the robustness of a prescribed-time observer for a class of nonlinear systems in the presence of disturbances and unmodeled dynamics. It is proven and demonstrated through simulations that the proposed observer…

Systems and Control · Electrical Eng. & Systems 2026-05-13 Abedou Abdelhadi , Mameche Omar

In this paper we are interested in the problem of state observation of state-affine nonlinear systems. Our main contribution is to propose a globally exponentially convergent observer that requires only the necessary assumption of…

Systems and Control · Electrical Eng. & Systems 2021-08-24 Lei Wang , Romeo Ortega , Alexei Bobtsov

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing

Coherent discourse is distinguished from a mere collection of utterances by the satisfaction of a diverse set of constraints, for example choice of expression, logical relation between denoted events, and implicit compatibility with…

Computation and Language · Computer Science 2021-05-11 Anne Beyer , Sharid Loáiciga , David Schlangen

This paper explores conditions of existence of different types of consistent tests. New links of these types of consistency are also established. The existence of discernible (strong consistent) tests follows from the existence of pointwise…

Statistics Theory · Mathematics 2015-04-22 Mikhail Ermakov

Unspeakable coherence is a key feature separating quantum and classical physics. Modelled as asymmetry with respect to a continuous transformation generated by a physically relevant observable, such as the Hamiltonian or angular moment,…

Quantum Physics · Physics 2025-12-05 Benjamin Stratton , Chung-Yun Hsieh , Paul Skrzypczyk