On the Parikh Membership Problem for FAs, PDAs, and CMs
We consider the problem of determining if a string w belongs to a language L specified by an automaton (NFA, or PDA augmented by reversal-bounded counters, etc.) where the string w is specified by its Parikh vector. If the automaton (PDA augmented with reversal-bounded counters) is fixed and the Parikh vector is encoded in unary (binary), the problem is in DLOGSPACE (PTIME). When the automaton is part of the input and the Parikh vector is encoded in binary, we show the following results: if the input is an NFA accepting a letter-bounded language (i.e., \(\subseteq a_1^* \cdots a_k^*\) for some distinct symbols a 1, ..., a k ), the problem is in PTIME, but if the input is an NFA accepting a word-bounded language (i.e., \(\subseteq w_1^* \cdots w_m^*\) for some nonnull strings w 1, ..., w m ), it is NP-complete. The proofs involve solving systems of linear Diophantine equations with non-negative integer coefficients. As an application of the results, we present efficient algorithms for a generalization of a tiling problem posed recently by Dana Scott. Finally, we give a classification of the complexity of the membership problem for restricted classes of semilinear sets.
KeywordsParikh vector NFA counter machine reversal-bounded counters CFG Chomsky Normal Form bounded language
Unable to display preview. Download preview PDF.
- 4.Golomb, S.W.: Polyominoes, 2nd edn. Princeton University Press (1994) ISBN 0-691-02444-8Google Scholar
- 5.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata, Languages and Computation. Addison-Wesley (1978)Google Scholar
- 6.Hyunh, T.-D.: The Complexity of semilinear sets. Elektr. Inform.-verarbeitung and Kybern. 6, 291–338 (1982)Google Scholar
- 9.Ibarra, O.H., Ravikumar, B.: On sparseness and ambiguity for acceptors and transducers. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol. 210, pp. 171–179. Springer, Heidelberg (1985)Google Scholar
- 13.Kopczynski, E., To, A.W.: Parikh Images of Grammars: Complexity and Applications. In: Proc. of 25th Annual IEEE Logic in Computer Science, pp. 80–89 (2010)Google Scholar
- 15.Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)Google Scholar
- 16.Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 583–548 (1983)Google Scholar
- 17.Lueker, G.S.: Two NP-Complete Problems in Nonnegative Integer Programming. Report No. 178, Computer Science Laboratory, Princeton University (1975)Google Scholar
- 19.Scott, D.S.: Programming a combinatorial puzzle. Technical Report No. 1, Department of Electrical Engineering. Princeton University (1958)Google Scholar
- 20.To, A.W.: Parikh Images of Regular Languages: Complexity and Applications (2010) (unpublished manuscript)Google Scholar