Decidability and Shortest Strings in Formal Languages
Formal Languages and Automata Theory
2011-03-22 v2
Abstract
Given a formal language L specified in various ways, we consider the problem of determining if L is nonempty. If L is indeed nonempty, we find upper and lower bounds on the length of the shortest string in L.
Cite
@article{arxiv.1103.1622,
title = {Decidability and Shortest Strings in Formal Languages},
author = {Levent Alpoge and Thomas Ang and Luke Schaeffer and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1103.1622},
year = {2011}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Formal Languages via Theories over Strings
Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea
2022-05-03
Formal Languages and Automata Theory · Computer Science
Optimal Test Sets for Context-Free Languages
Mikaël Mayer, Jad Hamza
2016-11-22
Formal Languages and Automata Theory · Computer Science
Automata and Reduced Words in the Free Group
Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey Shallit
2009-10-26
Computational Complexity · Computer Science
Detecting palindromes, patterns, and borders in regular languages
Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean +1
2009-04-14
Formal Languages and Automata Theory · Computer Science
Factorization in Formal Languages
Paul Bell, Daniel Reidenbach, Jeffrey Shallit
2015-03-24
Formal Languages and Automata Theory · Computer Science
On Upper and Lower Bounds on the Length of Alternating Towers
Štěpán Holub, Galina Jirásková, Tomáš Masopust
2014-07-10
Formal Languages and Automata Theory · Computer Science
Infinitude of Primes Using Formal Language Theory
Aalok Thakkar
2020-05-22
Formal Languages and Automata Theory · Computer Science
On the Separability Problem of String Constraints
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna
2020-05-21
Formal Languages and Automata Theory · Computer Science
Decision Problems on Copying and Shuffling
Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla
2026-04-08
Logic in Computer Science · Computer Science
The height of piecewise-testable languages and the complexity of the logic of subwords
Prateek Karandikar, Philippe Schnoebelen
2023-06-22
Quantum Physics · Physics
Decidable and undecidable problems about quantum automata
Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier
2007-05-23
Formal Languages and Automata Theory · Computer Science
On the state complexity of closures and interiors of regular languages with subwords and superwords
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
2015-12-02
High Energy Physics - Theory · Physics
Strings, T-duality breaking, and nonlocality without the shortest distance
H. Nikolic
2008-11-26
Formal Languages and Automata Theory · Computer Science
A decidable characterization of locally testable tree languages
Thomas Place, Luc Segoufin
2015-07-01
Formal Languages and Automata Theory · Computer Science
A Lower Bound for Primality of Finite Languages
Philip Sieder
2019-02-19
Formal Languages and Automata Theory · Computer Science
Some Remarks on First-Order Definable Tree Languages
Achim Blumensath
2024-07-02
Computation and Language · Computer Science
From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
Katsuhiko Hayashi, Hidetaka Kamigaito
2026-03-16
Formal Languages and Automata Theory · Computer Science
Lower Bounds on Regular Expression Size
Hamoon Mousavi
2017-12-08
Logic in Computer Science · Computer Science
Negated String Containment is Decidable (Technical Report)
Vojtěch Havlena, Michal Hečko, Lukáš Holík, Ondřej Lengál
2025-07-02
Formal Languages and Automata Theory · Computer Science
Final Sentential Forms
Tomáš Kožár, Zbyněk Křivka, Alexander Meduna
2023-09-19
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
Systems and Control · Computer Science
A Note on Undecidability of Observation Consistency for Non-Regular Languages
Tomáš Masopust
2012-01-10
Formal Languages and Automata Theory · Computer Science
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
Kord Eickmeyer, Georg Schindling
2025-07-08
Logic in Computer Science · Computer Science
A Second-Order Formulation of Non-Termination
Fred Mesnard, Etienne Payet
2014-12-11
Formal Languages and Automata Theory · Computer Science
The Alternation Hierarchy of First-Order Logic on Words is Decidable
Corentin Barloy, Michaël Cadilhac, Charles Paperman, Howard Straubing
2025-02-03