A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Introduction to Formal Language Theory
Introduction to Formal Language Theory
A Fast Algorithm to Decide on Simple Grammars Equivalence
Proceedings of the International Symposium on Optimal Algorithms
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
A characterization of s-languages
Information Processing Letters
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Prime decompositions of regular prefix codes
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Concatenation state machines and simple functions
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Equivalence of simple functions
Theoretical Computer Science
Reducing simple grammars: exponential against highly-polynomial time in practice
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Equivalence of functions represented by simple context-free grammars with output
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
A prefix-free language is a prime if it cannot be decomposed into a concatenation of two prefix-free languages. We show that we can check in polynomial time if a language generated by a simple context-free grammar is a prime. Our algorithm computes a canonical representation of a simple language, converting its arbitrary simple grammar into Prime Normal Form (PNF); a simple grammar is in PNF if all its nonterminals define primes. We also improve the complexity of testing the equivalence of simple grammars. The best previously known algorithm for this problem worked in O(n13) time. We improve it to O(n7 log2n) and O(n5 polylog v) deterministic time, and O(n4 polylog n) randomized time, where n is the total size of the grammars involved, and v is the length of a shortest string derivable from a nonterminal, maximized over all nonterminals. Our improvement is based on a version of Caucal's algorithm from [1].