{"issue":"4","language":[{"iso":"eng"}],"type":"journal_article","date_updated":"2022-01-06T07:03:17Z","publication":"Discrete Mathematics & Theoretical Computer Science","doi":"10.23638/DMTCS-19-4-1","author":[{"full_name":"Czerwinski, Wojciech","last_name":"Czerwinski","first_name":"Wojciech"},{"full_name":"Martens, Wim","last_name":"Martens","first_name":"Wim"},{"first_name":"Lorijn","last_name":"van Rooijen","id":"58843","full_name":"van Rooijen, Lorijn"},{"full_name":"Zeitoun, Marc","last_name":"Zeitoun","first_name":"Marc"},{"last_name":"Zetzsche","full_name":"Zetzsche, Georg","first_name":"Georg"}],"year":"2017","status":"public","intvolume":"        19","date_created":"2019-01-15T09:54:52Z","user_id":"58843","citation":{"ama":"Czerwinski W, Martens W, van Rooijen L, Zeitoun M, Zetzsche G. A Characterization for Decidable Separability by Piecewise Testable Languages. <i>Discrete Mathematics &#38; Theoretical Computer Science</i>. 2017;19(4). doi:<a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">10.23638/DMTCS-19-4-1</a>","mla":"Czerwinski, Wojciech, et al. “A Characterization for Decidable Separability by Piecewise Testable Languages.” <i>Discrete Mathematics &#38; Theoretical Computer Science</i>, vol. 19, no. 4, 2017, doi:<a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">10.23638/DMTCS-19-4-1</a>.","ieee":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, and G. Zetzsche, “A Characterization for Decidable Separability by Piecewise Testable Languages,” <i>Discrete Mathematics &#38; Theoretical Computer Science</i>, vol. 19, no. 4, 2017.","apa":"Czerwinski, W., Martens, W., van Rooijen, L., Zeitoun, M., &#38; Zetzsche, G. (2017). A Characterization for Decidable Separability by Piecewise Testable Languages. <i>Discrete Mathematics &#38; Theoretical Computer Science</i>, <i>19</i>(4). <a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">https://doi.org/10.23638/DMTCS-19-4-1</a>","bibtex":"@article{Czerwinski_Martens_van Rooijen_Zeitoun_Zetzsche_2017, title={A Characterization for Decidable Separability by Piecewise Testable Languages}, volume={19}, DOI={<a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">10.23638/DMTCS-19-4-1</a>}, number={4}, journal={Discrete Mathematics &#38; Theoretical Computer Science}, author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc and Zetzsche, Georg}, year={2017} }","short":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, G. Zetzsche, Discrete Mathematics &#38; Theoretical Computer Science 19 (2017).","chicago":"Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, and Georg Zetzsche. “A Characterization for Decidable Separability by Piecewise Testable Languages.” <i>Discrete Mathematics &#38; Theoretical Computer Science</i> 19, no. 4 (2017). <a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">https://doi.org/10.23638/DMTCS-19-4-1</a>."},"volume":19,"_id":"6725","title":"A Characterization for Decidable Separability by Piecewise Testable Languages","department":[{"_id":"66"}]}