Separating Regular Languages by Piecewise Testable and Unambiguous Languages
T. Place, L. van Rooijen, M. Zeitoun, in: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 729–740.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Place, Thomas;
van Rooijen, LorijnLibreCat;
Zeitoun, Marc
Department
Publishing Year
Proceedings Title
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013
Page
729-740
ISBN
LibreCat-ID
Cite this
Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740. doi:10.1007/978-3-642-40313-2_64
Place, T., van Rooijen, L., & Zeitoun, M. (2013). Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013 (pp. 729–740). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_64
@inproceedings{Place_van Rooijen_Zeitoun_2013, place={Berlin, Heidelberg}, title={Separating Regular Languages by Piecewise Testable and Unambiguous Languages}, DOI={10.1007/978-3-642-40313-2_64}, booktitle={Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}, publisher={Springer Berlin Heidelberg}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}, year={2013}, pages={729–740} }
Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, 729–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-40313-2_64.
T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by Piecewise Testable and Unambiguous Languages,” in Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, 2013, pp. 729–740.
Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:10.1007/978-3-642-40313-2_64.
Google Scholar
ISBN Search