Fast equivalence-checking for normed context-free processes

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 8, Issue , 2010, Pages 260-271

  Czerwiński, Wojciech ^a   Lasota, Sławomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMULATION EQUIVALENCES; CONTEXT-FREE PROCESS; POLYNOMIAL-TIME;

CONTEXT FREE LANGUAGES; POLYNOMIAL APPROXIMATION;

SOFTWARE ENGINEERING;

EID: 84872063156     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2010.260     Document Type: Conference Paper

References (15)

1. Y. Bar-Hillel, M. Perles, and S. Shamir. On formal properties of simple phrase structure grammars. Zeitschrift fuer Phonetik, Sprachwissenschaft, und Kommunikationsforschung, 14:143-177, 1961.
2. C. Bastien, J. Czyżowicz, W. Fraczak, and W. Rytter. Prime normal form and equivalence of simple grammars. In Proc. CIAA'05, volume 3845 of LNCS, pages 79-90. Springer-Verlag, 2005.
3. J. Beaten, J. Bergstra, and J. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proc. PARLE'87, volume 259 of LNCS, pages 94-113. Springer-Verlag, 1987.
4. D. Caucal. Graphes canoniques des graphes algébraiques. Informatique Théoretique et Applications (RAIRO), 24(4):339-352, 1990.
5. S. Christensen, Y. Hirshfeld, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 12(2):143-148, 1995.
6. W. Czerwiński, S. Fröschle, and S. Lasota. Partially-commutative context-free processes. In Proc. CONCUR'09, volume 5710 of LNCS, pages 259-273. Springer-Verlag, 2009.
7. E.P. Friedman. The inclusion problem for simple languages. Theoretical Computer Science, 1:297-316, 1976.
8. R. v. Glabbeek. The linear time - branching time spectrum. In Proc. CONCUR'90, pages 278-297, 1990.
9. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity on normed context-free processes. Theoretical Computer Science, 15:143-159, 1996.
10. H. Huettel and C. Stirling. Actions speak louder than words: proving bisimilarity for context-free processes. In Proc. LICS'91, pages 376-386. IEEE Computer Society Press, 1991.
11. 2. Theoretical Computer Science, 123:183-197, 1994.
12. A. Korenjak and J. Hopcroft. Simple deterministic languages. In Proc. 7th Annual IEEE Symposium on Switching and Automata Theory, pages 36-46, 1966.
13. S. Lasota and W. Rytter. Faster algorithm for bisimulation equivalence of normed context-free processes. In Proc. MFCS'06, volume 4162 of LNCS, pages 646-657. Springer-Verlag, 2006.
14. Y. Lifshits. Solving classical string problems an compressed texts. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 2006.
15. A. Shinohara, M. Miyazaki, and M. Takeda. An improved pattern-matching algorithm for strings in terms of straight-line programs. Journal of Discrete Algorithms, 1(1):187-204, 2000.