Finding the growth rate of a regular or context-free language in polynomial time. (English) Zbl 1206.68172
Summary: We give an \(O(n + t)\) time algorithm to determine whether an NFA with \(n\) states and \(t\) transitions accepts a language of polynomial or exponential growth. Given an NFA accepting a language of polynomial growth, we can also determine the order of polynomial growth in \(O(n+t)\) time. We also give polynomial time algorithms to solve these problems for context-free grammars.
MSC:
| 68Q45 | Formal languages and automata |
References:
| [1] | DOI: 10.1016/j.laa.2004.12.007 · Zbl 1074.15033 · doi:10.1016/j.laa.2004.12.007 |
| [2] | DOI: 10.1006/jcss.2001.1804 · Zbl 1013.68123 · doi:10.1006/jcss.2001.1804 |
| [3] | DOI: 10.1016/S0019-9958(58)90082-2 · Zbl 0081.14503 · doi:10.1016/S0019-9958(58)90082-2 |
| [4] | Cormen T., Introduction to Algorithms (2001) · Zbl 1047.68161 |
| [5] | DOI: 10.1006/jsco.2002.0554 · Zbl 1016.65025 · doi:10.1006/jsco.2002.0554 |
| [6] | Ginsburg S., The Mathematical Theory of Context-free Languages (1966) · Zbl 0184.28401 |
| [7] | Ginsburg S., Trans. Amer. Math. Soc. 113 pp 333– |
| [8] | DOI: 10.1090/S0002-9939-1966-0201310-3 · doi:10.1090/S0002-9939-1966-0201310-3 |
| [9] | DOI: 10.1051/ita:2000100 · Zbl 0966.68097 · doi:10.1051/ita:2000100 |
| [10] | Incitti R., Theoret. Comput. Sci. 225 pp 601– |
| [11] | DOI: 10.1016/j.laa.2007.08.001 · Zbl 1145.65030 · doi:10.1016/j.laa.2007.08.001 |
| [12] | DOI: 10.1007/s00037-004-0185-3 · Zbl 1061.68185 · doi:10.1007/s00037-004-0185-3 |
| [13] | Karpinski M., Nordic. J. Computing 4 pp 172– |
| [14] | DOI: 10.1016/S0019-9958(70)90105-1 · Zbl 0193.32603 · doi:10.1016/S0019-9958(70)90105-1 |
| [15] | Latteux M., Elektron. Informationsverarb. Kybernet 20 pp 3– |
| [16] | Lyndon R. C., Michigan Math. J. 9 pp 289– |
| [17] | Minc H., Nonnegative Matrices (1988) |
| [18] | DOI: 10.1016/S0304-3975(96)00308-8 · Zbl 0911.68097 · doi:10.1016/S0304-3975(96)00308-8 |
| [19] | Shallit J., A Second Course in Formal Languages and Automata Theory (2009) · Zbl 1163.68025 |
| [20] | Shur A. M., Discr. Anal. and Oper. Research, Ser. 1 12 pp 78– |
| [21] | Trofimov V. I., Cybernetics 6 pp 9– |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
