Author:
Béal Marie-Pierre,Champarnaud Jean-Marc,Dubernard Jean-Philippe,Jeanne Hadrien,Lombardy Sylvain
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Benois, M., Sakarovitch, J.: On the complexity of some extended word problems defined by cancellation rules. Inform. Process. Lett. 23, 281–287 (1986)
2. Blanpain, B., Champarnaud, J.-M., Dubernard, J.-P.: Geometrical languages. In: LATA (Languages and Automata Theoretical Aspects), vol. Pre-proceedings, Report 35/07 of GRLMC Universitat Rovira I Virgili, pp. 127–138 (2007)
3. Lecture Notes in Computer Science;J.-M. Champarnaud,2011
4. 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, 763–774 (2009)
5. Lecture Notes in Computer Science;J.-M. Champarnaud,2010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献