Author:
Karhuma¨ki Juhani,Rytter Wojciech,Jarominek Stefan
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Test sets for context-free languages and algebraic systems of equations;Albert;Inform. and Control,1982
2. A proof of Ehrenfeucht conjecture;Albert;Theoret. Comput. Sci.,1985
3. The decidability of equivalence for deterministic finite transducers;Blattner;J. Comput. System Sci.,1979
4. Parallel computations on strings and arrays;Crochemore,1990
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Deciding Whether two Codes Have the Same Ambiguities is in co-NP;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
2. Test Sets for Large Families of Languages;Developments in Language Theory;2003
3. Solving Problems with Finite Test Sets;Finite Versus Infinite;2000
4. Polynomial size test sets for commutative languages;RAIRO - Theoretical Informatics and Applications;1997
5. Morphisms;Handbook of Formal Languages;1997