{"doi":"10.1007/978-3-642-40313-2_64","date_updated":"2022-01-06T07:03:17Z","type":"conference","publication":"Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013","page":"729-740","language":[{"iso":"eng"}],"publication_status":"published","title":"Separating Regular Languages by Piecewise Testable and Unambiguous Languages","_id":"6732","department":[{"_id":"66"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642403125","9783642403132"]},"date_created":"2019-01-15T10:23:36Z","user_id":"58843","citation":{"apa":"Place, T., van Rooijen, L., &#38; Zeitoun, M. (2013). Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i> (pp. 729–740). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">https://doi.org/10.1007/978-3-642-40313-2_64</a>","short":"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.","chicago":"Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” In <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>, 729–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">https://doi.org/10.1007/978-3-642-40313-2_64</a>.","ieee":"T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by Piecewise Testable and Unambiguous Languages,” in <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>, 2013, pp. 729–740.","ama":"Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In: <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740. doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">10.1007/978-3-642-40313-2_64</a>","mla":"Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” <i>Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013</i>, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">10.1007/978-3-642-40313-2_64</a>.","bibtex":"@inproceedings{Place_van Rooijen_Zeitoun_2013, place={Berlin, Heidelberg}, title={Separating Regular Languages by Piecewise Testable and Unambiguous Languages}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40313-2_64\">10.1007/978-3-642-40313-2_64</a>}, 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} }"},"year":"2013","place":"Berlin, Heidelberg","status":"public","author":[{"first_name":"Thomas","last_name":"Place","full_name":"Place, Thomas"},{"full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","id":"58843","first_name":"Lorijn"},{"full_name":"Zeitoun, Marc","last_name":"Zeitoun","first_name":"Marc"}],"publisher":"Springer Berlin Heidelberg","extern":"1"}