Author:
Champarnaud Jean-Marc,Dubernard Jean-Philippe,Jeanne Hadrien
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Baruah, S.K., Rosier, L.E., Howell, R.R.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems 2(4), 301–324 (1990)
2. Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete & Computational Geometry 6, 575–592 (1991)
3. Blanpain, B., Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: Geometrical languages. In: Martin Vide, C. (ed.) International Conference on Language Theory and Automata (LATA 2007), vol. 35/07, GRLMC Universitat Rovira I Virgili (2007)
4. Lecture Notes in Computer Science;J.-M. Champarnaud,2010
5. Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: An efficient algorithm to test whether a binary and prolongeable regular language is geometrical. Int. J. Found. Comput. Sci. 20(4), 763–774 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献