Testing equivalence of morphisms on context-free languages-Reference-Cited by-同舟云学术

Testing equivalence of morphisms on context-free languages

Published:1994 Issue: Volume: Page:460-470
ISSN:0302-9743
Container-title:Algorithms — ESA '94
language:
Short-container-title:

Author:

Plandowski Wojciech

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0049431

Reference11 articles.

1. J. Aho, J. Hopcroft, J. Ullman, “The design and analysis of computer algorithms”, Addison-Wesley, 1974.

2. J. Albert, K. Culik II, J. Karhumäki, Test sets for context-free languages and algebraic systems of equations, Inform. Control 52(1982), 172–186.

3. J. Jaffar, Minimal and complete word unification, JACM 37(1), 47–85.

4. S. Jarominek, J. Karhumäki, W. Rytter, Efficient construction of test sets for regular and context-free languages, Theoret. Comp. Science (to appear).

5. J. Karhumäki, W. Plandowski, W. Rytter, Polynomial size test sets for contextfree languages, JCSS (to appear).

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

1. Context-Bounded Verification of Context-Free Specifications;Proceedings of the ACM on Programming Languages;2023-01-09

2. Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems;ACM Transactions on Computation Theory;2022-12-31

3. The compressed word problem in relatively hyperbolic groups;Journal of Algebra;2022-10

4. Logspace and compressed-word computations in nilpotent groups;Transactions of the American Mathematical Society;2022-06-10

5. Compression Techniques in Group Theory;Lecture Notes in Computer Science;2021