Abstract
We continue the study of the shuffle of individual words, and the problem of decomposing a finite automaton into the shuffle on words. There is a known polynomial time algorithm to decide whether the shuffle of two words is a subset of the language accepted by a deterministic finite automaton [5]. In this paper, we consider the converse problem of determining whether or not the language accepted by a deterministic finite automaton is a subset of the shuffle of two words. We provide a polynomial time algorithm to decide whether the language accepted by a deterministic finite automaton is a subset of the shuffle of two words, for the special case when the skeletons of the two words are of fixed length. Therefore, for this special case, we can decide equality in polynomial time as well. However, we then show that this problem is coNP-Complete in general, as conjectured in [2].
Research supported, in part, by the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berstel, J., Boasson, L.: Shuffle factorization is unique. Theoretical Computer Science 273, 47–67 (2002)
Biegler, F.: Decomposition and Descriptional Complexity of Shuffle on Words and Finite Languages. Ph.D. thesis, University of Western Ontario, London, Canada (2009)
Biegler, F., Daley, M., Holzer, M., McQuillan, I.: On the uniqueness of shuffle on words and finite languages. Theoretical Computer Science 410, 3711–3724 (2009)
Biegler, F., Daley, M., McQuillan, I.: On the shuffle automaton size for words. Journal of Automata, Languages and Combinatorics 15, 53–70 (2010)
Biegler, F., Daley, M., McQuillan, I.: Algorithmic decomposition of shuffle on words. Theoretical Computer Science 454, 38–50 (2012)
Câmpeanu, C., Salomaa, K., Vágvölgyi, S.: Shuffle quotient and decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 186–196. Springer, Heidelberg (2002)
Ginsburg, S., Spanier, E.: Mappings of languages by two-tape devices. Journal of the ACM 12(3), 423–434 (1965)
Holub, J., Melichar, B.: Implementation of nondeterministic finite automata for approximate pattern matching. In: Champarnaud, J.-M., Maurel, D., Ziadi, D. (eds.) WIA 1998. LNCS, vol. 1660, pp. 92–99. Springer, Heidelberg (1999)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Jędrzejowicz, J., Szepietowski, A.: Shuffle languages are in P. Theoretical Computer Science 250, 31–53 (2001)
Papadimitriou, C.M.: Computational complexity. Addison-Wesley, Reading (1994)
Warmuth, M., Haussler, D.: On the complexity of iterated shuffle. Journal of Computer and System Sciences 28(3), 345–358 (1984)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Biegler, F., McQuillan, I. (2014). On Comparing Deterministic Finite Automata and the Shuffle of Words. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-08846-4_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08845-7
Online ISBN: 978-3-319-08846-4
eBook Packages: Computer ScienceComputer Science (R0)