Subject
General Computer Science,Theoretical Computer Science
Reference63 articles.
1. Test sets for context-free languages and algebraic systems of equations;Albert;Inform. and Control,1982
2. Test sets for finite substitutions;Albert;Theoret. Comput. Sci.,1986
3. A proof of Ehrenfeucht Conjecture;Albert;Theoret. Comput. Sci.,1985
4. On formal properties of simple phrase structure grammars;Bar-Hillel;Sprachwiss. Kommunikationforsch.,1961
5. Transductions and Context-Free Languages;Berstel,1979
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Equivalence Problem for Computational Models: Decidable and Undecidable Cases;Lecture Notes in Computer Science;2001
2. T(A) = T(B)?;Automata, Languages and Programming;1999
3. Decomposing a $k$-valued transducer into $k$ unambiguous ones;RAIRO - Theoretical Informatics and Applications;1996
4. Hard sets method and semilinear reservoir method with applications;Automata, Languages and Programming;1996
5. Publications of K. Culik;RAIRO - Theoretical Informatics and Applications;1994