Prime normal form and equivalence of simple grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3845 LNCS, Issue , 2006, Pages 78-89

  Bastien, Cédric ^a   Czyzowicz, Jurek ^a   Fraczak, Wojciech ^a,b   Rytter, Wojciech ^c,d  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b IDT Canada   (Canada)

^c UNIVERSITY OF WARSAW   (Poland)

^d NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; PERTURBATION TECHNIQUES; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RANDOM PROCESSES;

CANONICAL REPRESENTATION; POLYNOMIAL TIME; PREFIX FREE LANGUAGE; PRIME NORMAL FORM (PNF);

CONTEXT FREE GRAMMARS;

EID: 33745167277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_7     Document Type: Conference Paper

References (14)

1. Caucal, D.: A fast algorithm to decide on simple grammars equivalence. In: Optimal Algorithms. Volume 401 of LNCS. Springer (1989) 66-85
2. Courcelle, B.: Une forme canonique pour les grammaires simples deterministes. RAIRO informatique (1974) 19-36
3. Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proc. IEEE 7th Annual Symposium on Switching and Automata Theory. IEEE Symposium on Foundations of Computer Science (1966) 36-46
4. Harrison, M.: Introduction to formal language theory. Addison Wesley (1978)
5. Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158 (1996) 143-159
6. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: ESA. Volume 855 of LNCS. Springer (1994) 460-470
7. Karpinski, M., Rytter, W., Shinohara, A.: Pattern-matching for strings with short descriptions. In Galil, Z., Ukkonen, E., eds.: Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching. Number 937, Espoo, Finland, Springer-Verlag, Berlin (1995) 205-214
8. Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching for strings in terms of straight-line programs. Journal of Discrete Algorithms 1 (2000) 187-204
9. Debski, W., Fraczak, W.: Concatenation state machines and simple functions. In: Implementation and Application of Automata, CIAA'04. Volume 3317 of LNCS. Springer (2004) 113-124
10. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Prime decompositions of regular prefix codes. In: Implementation and Application of Automata, CIAA 2002. Volume 2608 of LNCS. Springer, Tours, France (2003) 85-94
11. Fraczak, W., Podolak, A.: A characterization of s-languages. Information Processing Letters 89 (2004) 65-70
12. Georgiadis, L., Tarjan, R.E.: Finding dominators revisited: extended abstract. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, SIAM (2004) 869-878
13. Courcelle, B.: An axiomatic approach to the Korenjak-Hopcroft algorithms. Mathematical Systems Theory 16 (1983) 191-231
14. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science 302 (2003) 211-222