{"year":"2015","status":"public","department":[{"_id":"66"}],"author":[{"last_name":"Czerwinski","full_name":"Czerwinski, Wojciech","first_name":"Wojciech"},{"first_name":"Wim","full_name":"Martens, Wim","last_name":"Martens"},{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"},{"first_name":"Marc","last_name":"Zeitoun","full_name":"Zeitoun, Marc"}],"type":"conference","user_id":"58843","language":[{"iso":"eng"}],"date_created":"2019-01-15T10:01:56Z","page":"173-185","date_updated":"2022-01-06T07:03:17Z","extern":"1","_id":"6726","doi":"10.1007/978-3-319-22177-9\\_14","publication":"Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings","citation":{"chicago":"Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, and Marc Zeitoun. “A Note on Decidable Separability by Piecewise Testable Languages.” In Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 173–85, 2015. https://doi.org/10.1007/978-3-319-22177-9\\_14.","apa":"Czerwinski, W., Martens, W., van Rooijen, L., & Zeitoun, M. (2015). A Note on Decidable Separability by Piecewise Testable Languages. In Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings (pp. 173–185). https://doi.org/10.1007/978-3-319-22177-9\\_14","mla":"Czerwinski, Wojciech, et al. “A Note on Decidable Separability by Piecewise Testable Languages.” Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–85, doi:10.1007/978-3-319-22177-9\\_14.","short":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, in: Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–185.","ieee":"W. Czerwinski, W. Martens, L. van Rooijen, and M. Zeitoun, “A Note on Decidable Separability by Piecewise Testable Languages,” in Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–185.","bibtex":"@inproceedings{Czerwinski_Martens_van Rooijen_Zeitoun_2015, title={A Note on Decidable Separability by Piecewise Testable Languages}, DOI={10.1007/978-3-319-22177-9\\_14}, booktitle={Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings}, author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc}, year={2015}, pages={173–185} }","ama":"Czerwinski W, Martens W, van Rooijen L, Zeitoun M. A Note on Decidable Separability by Piecewise Testable Languages. In: Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. ; 2015:173-185. doi:10.1007/978-3-319-22177-9\\_14"},"title":"A Note on Decidable Separability by Piecewise Testable Languages"}