Decidability and shortest strings in formal languages

Authors:
Levent Alpoge;Thomas Ang;Luke Schaeffer;Jeffrey Shallit
Affiliations:
Harvard College, Cambridge, MA;School of Computer Science, University of Waterloo, Waterloo, ON, Canada;School of Computer Science, University of Waterloo, Waterloo, ON, Canada;School of Computer Science, University of Waterloo, Waterloo, ON, Canada
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 4
Cited 1

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences

Computing the edit-distance between a regular language and a context-free language

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

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.