Author:
Holub Štěpán,Kortelainen Juha
Subject
Computer Science Applications,General Mathematics,Software
Reference16 articles.
1. J. Albert,On test sets, checking sets, maximal extensions and their effective constructions.Habilitationsschirft, Fakultät für Wirtschaftswissenschaften der Universität Karlsruhe (1968).
2. A proof of Ehrenfeucht's Conjecture
3. Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages
4. Ch. Choffrut and J. Karhumäki,Combinatorics on words, in Handbook of Formal Languages, Vol. I, edited by G. Rosenberg and A. Salomaa. Springer-Verlag, Berlin (1997) 329-438.
5. On binary equality sets and a solution to the test set conjecture in the binary case
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Commutation and Beyond;Lecture Notes in Computer Science;2017
2. Periodicity forcing words;Theoretical Computer Science;2015-10
3. ON THE DUAL POST CORRESPONDENCE PROBLEM;International Journal of Foundations of Computer Science;2014-12
4. Periodicity Forcing Words;Lecture Notes in Computer Science;2013
5. Parikh test sets for commutative languages;RAIRO - Theoretical Informatics and Applications;2008-06-03