FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME-Reference-Cited by-同舟云学术

FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME

Published:2010-08 Issue:04 Volume:21 Page:597-618
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

GAWRYCHOWSKI PAWEŁ¹,KRIEGER DALIA²,RAMPERSAD NARAD²,SHALLIT JEFFREY²

Affiliation:

1. Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, PL-50-383 Wrocław, Poland

2. School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

Abstract

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054110007441

Reference21 articles.

1. A gap result for the norms of semigroups of matrices

2. Context-Free Languages of Sub-exponential Growth

3. Finite state languages

4. Computing Rational Forms of Integer Matrices

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Quantitative estimates for the size of an intersection of sparse automatic sets;Theoretical Computer Science;2023-10

3. Multiplicity Problems on Algebraic Series and Context-Free Grammars;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

4. Unboundedness Problems for Machines with Reversal-Bounded Counters;Lecture Notes in Computer Science;2023

5. The Big-O Problem;Logical Methods in Computer Science;2022-03-15