English

Absoluteness of subword inequality is undecidable

Formal Languages and Automata Theory 2011-08-16 v1
Authors: Shinnosuke Seki
View on arXiv ↗ PDF ↗

Abstract

Mateescu, Salomaa, and Yu asked: is it decidable whether a given subword history assumes only non-negative values for all words over a given alphabet. In this paper, we solve this open problem by proving that this problem is undecidable even under stronger conditions than supposed originally.

Keywords

subword inequality absoluteness undecidability subword history formal languages

Cite

@article{arxiv.1108.2758,
  title  = {Absoluteness of subword inequality is undecidable},
  author = {Shinnosuke Seki},
  journal= {arXiv preprint arXiv:1108.2758},
  year   = {2011}
}

Related papers

View all related →
Logic in Computer Science · Computer Science
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
2021-09-27
Logic · Mathematics
A variety with solvable, but not uniformly solvable, word problem
Alan H. Mekler, Evelyn Nelson, Saharon Shelah
2016-09-06
Operator Algebras · Mathematics
Eigenvalues of Words in Two Positive Definite Letters
Christopher J Hillar, Charles R Johnson
2007-05-23
Formal Languages and Automata Theory · Computer Science
Decidable Problems for Probabilistic Automata on Infinite Words
Krishnendu Chatterjee, Mathieu Tracol
2011-07-12
Formal Languages and Automata Theory · Computer Science
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
Christof Löding, Christopher Spinrath
2023-06-22
Logic in Computer Science · Computer Science
(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints
Vijay Ganesh, Mia Minnes, Armando Solar-Lezama, Martin Rinard
2013-06-26
Logic in Computer Science · Computer Science
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability
Joel Day, Vijay Ganesh, Paul He, Florin Manea +1
2018-02-05
Formal Languages and Automata Theory · Computer Science
Undecidability and Finite Automata
Jörg Endrullis, Jeffrey Shallit, Tim Smith
2017-03-01
Logic in Computer Science · Computer Science
The Decidability Frontier for Probabilistic Automata on Infinite Words
Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol
2011-04-28
Logic · Mathematics
Diamonds and Dominoes: Impossibility Results for Associative Modal Logics
Søren Brinck Knudstorp
2025-06-23
Group Theory · Mathematics
The word and order problems for self-similar and automata groups
Laurent Bartholdi, Ivan Mitrofanov
2017-11-28
Formal Languages and Automata Theory · Computer Science
The Complexity of Unavoidable Word Patterns
Paul Sauer
2019-07-16
Formal Languages and Automata Theory · Computer Science
Resolving Nondeterminism by Chance
Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang +2
2026-04-01
Combinatorics · Mathematics
On additive complexity of infinite words
Graham Banero
2012-09-24
Logic · Mathematics
Undecidability in First-Order Theories of Term Algebras Extended with a Substitution Operator
Juvenal Murwanashyaka
2021-11-02
Logic in Computer Science · Computer Science
First order synthesis for data words revisited
Julien Grange, Mathieu Lehaut
2023-07-11
Logic in Computer Science · Computer Science
Undecidable Problems About Timed Automata
Olivier Finkel
2007-12-11
Formal Languages and Automata Theory · Computer Science
Language Emptiness of Continuous-Time Parametric Timed Automata
Nikola Beneš, Peter Bezděk, Kim G. Larsen, Jiří Srba
2016-08-08
Logic in Computer Science · Computer Science
The MSO+U theory of (N, <) is undecidable
Mikołaj Bojańczyk, Paweł Parys, Szymon Toruńczyk
2015-02-18
Logic in Computer Science · Computer Science
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
2014-06-03
Formal Languages and Automata Theory · Computer Science
When is Containment Decidable for Probabilistic Automata?
Laure Daviaud, Marcin Jurdziński, Ranko Lazić, Filip Mazowiecki +2
2020-03-31
Formal Languages and Automata Theory · Computer Science
Deciding the Value 1 Problem of Probabilistic Leaktight Automata
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2012-01-27
Computational Complexity · Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Olivier Finkel
2009-08-04
Quantum Physics · Physics
Decidable and undecidable problems about quantum automata
Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier
2007-05-23
Group Theory · Mathematics
Amalgams of inverse semigroups and reversible two-counter machines
Emanuele Rodaro, Pedro V. Silva
2013-04-08