Partial word DFAs

Authors:
Eric Balkanski;F. Blanchet-Sadri;Matthew Kilgore;B. J. Wyatt
Affiliations:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA;Department of Computer Science, University of North Carolina, Greensboro, NC;Department of Mathematics, Lehigh University, Bethlehem, PA;Department of Computer Science, University of North Carolina, Greensboro, NC
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 5
Cited 0

Regular languages

Handbook of formal languages, vol. 1
Partial words and a theorem of Fine and Wilf

Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)

Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Connecting partial words and regular languages

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a "hole" symbol ⋄. If we restrict what the symbol ⋄ can represent, we can use partial words to compress the representation of regular languages. Doing so allows the creation of so-called ⋄-DFAs which are smaller than the DFAs recognizing the original language L, which recognize the compressed language. However, the ⋄-DFAs may be larger than the NFAs recognizing L. In this paper, we investigate a question of Dassow et al. as to how these sizes are related.