Abstract
We initiate a multivariate analysis of two well-known NPhard decision problems on DFAs: the problem of finding a short synchronizing word and that of finding a DFA on few states consistent with a given sample of the intended language and its complement. For both problems, we study natural parameterizations and classify them with the tools provided by Parameterized Complexity. Somewhat surprisingly, in both cases, rather simple FPT algorithms can be shown to be optimal, mostly assuming the (Strong) Exponential Time Hypothesis.
This work is supported by the Norwegian and the German Research Councils.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2(2), 153–177 (2006)
Angluin, D.: On the complexity of minimum inference of regular sets. Information and Control (now Information and Computation) 39, 337–350 (1978)
Arvind, V., Köbler, J., Lindner, W.: Parameterized learnability of juntas. Theoretical Computer Science 410(47-49), 4928–4936 (2009)
Berlinkov, M.V.: Approximating the Minimum Length of Synchronizing Words Is Hard. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 37–47. Springer, Heidelberg (2010)
Björklund, H., Martens, W.: The tractability frontier for NFA minimization. Journal of Computer and System Sciences 78(1), 198–210 (2012)
Calabro, C., Impagliazzo, R., Paturi, R.: The Complexity of Satisfiability of Small Depth Circuits. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 75–85. Springer, Heidelberg (2009)
Černý, J.: Poznámka k homogénnym experimentom s konečnými automatmi. Matematicko-fyzikálny Časopis 14(3), 208–216 (1964)
Chen, J., Zhang, F.: On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]. Theoretical Computer Science 363(3), 278–288 (2006)
Costa Florêncio, C., Fernau, H.: On families of categorial grammars of bounded value, their learnability and related complexity questions. Theoretical Computer Science 452, 21–38 (2012)
Costa Florêncio, C., Verwer, S.: Regular Inference as Vertex Coloring. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS (LNAI), vol. 7568, pp. 81–95. Springer, Heidelberg (2012)
Dejean, F., Schützenberger, M.P.: On a question of Eggan. Information and Control (now Information and Computation) 9(1), 23–25 (1966)
Demaine, E.D., Eisenstat, S., Shallit, J., Wilson, D.A.: Remarks on Separating Words. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol. 6808, pp. 147–157. Springer, Heidelberg (2011)
Downey, R.G., Evans, P.A., Fellows, M.R.: Parameterized learning complexity. In: Proc. Sixth Annual ACM Conference on Computational Learning Theory, COLT, pp. 51–57. ACM Press (1993)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Eppstein, D.: Reset sequences for monotonic automata. SIAM Journal on Computing 19(3), 500–510 (1990)
Fellows, M.: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 2–10. Springer, Heidelberg (2009)
Fellows, M.R., Fernau, H.: Facility location problems: A parameterized view. Discrete Applied Mathematics 159, 1118–1130 (2011)
Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the number of numbers. Theory of Computing Systems 50(4), 675–693 (2012)
Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Dwork, C. (ed.) ACM Symposium on Theory of Computing, STOC, pp. 133–142. ACM (2008)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Gold, E.M.: Language identification in the limit. Information and Control (now Information and Computation) 10, 447–474 (1967)
Gold, E.M.: Complexity of automaton identification from given data. Information and Control (now Information and Computation) 37, 302–320 (1978)
de la Higuera, C.: Grammatical inference. Learning automata and grammars. Cambridge University Press (2010)
Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Information and Computation 209(3), 456–470 (2011)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63(4), 512–530 (2001)
Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill (1970)
Lee, D., Yannakakis, M.: Testing finite state machines: State identification and verification. IEEE Transactions on Computers 43, 306–320 (1994)
Pitt, L., Warmuth, M.K.: The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM 40, 95–142 (1993)
Sandberg, S.: Homing and Synchronizing Sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)
Stephan, F., Yoshinaka, R., Zeugmann, T.: On the parameterised complexity of learning patterns. In: Gelenbe, E., Lent, R., Sakellari, G. (eds.) Computer and Information Sciences II - 26th International Symposium on Computer and Information Sciences, ISCIS, pp. 277–281. Springer (2011)
Trahtman, A.N.: Modifying the Upper Bound on the Length of Minimal Synchronizing Word. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 173–180. Springer, Heidelberg (2011)
Volkov, M.V.: Synchronizing Automata and the Černý Conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)
Walker, P.J.: Synchronizing Automata and a Conjecture of Černý. Ph.D. thesis, University of Manchester, UK (2008)
Wareham, H.T.: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 302–310. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernau, H., Heggernes, P., Villanger, Y. (2013). A Multivariate Analysis of Some DFA Problems. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2013. Lecture Notes in Computer Science, vol 7810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37064-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-37064-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37063-2
Online ISBN: 978-3-642-37064-9
eBook Packages: Computer ScienceComputer Science (R0)