An Efficient Algorithm for the Computation of the Controllability Prefix of (*)-Languages

Moor T, Schmidt KW, Schmuck AK (2020)

Publication Type: Conference contribution

Publication year: 2020

Journal

IFAC-PapersOnLine International Federation of Automatic Control

Publisher: ELSEVIER

City/Town: AMSTERDAM

Pages Range: 2122-2129

Conference Proceedings Title: IFAC PAPERSONLINE

DOI: 10.1016/j.ifacol.2020.12.2701

Authors with CRIS profile

Thomas Moor Professur für Regelungstechnik

Involved external institutions

Max Planck Institute for Software Systems DE Germany (DE) Middle East Technical University (METU) / Orta Doğu Teknik Üniversitesi TR Turkey (TR)

How to cite

APA:

Moor, T., Schmidt, K.W., & Schmuck, A.-K. (2020). An Efficient Algorithm for the Computation of the Controllability Prefix of (*)-Languages. In IFAC PAPERSONLINE (pp. 2122-2129). AMSTERDAM: ELSEVIER.

MLA:

Moor, Thomas, Klaus Werner Schmidt, and Anne-Kathrin Schmuck. "An Efficient Algorithm for the Computation of the Controllability Prefix of (*)-Languages." Proceedings of the 21st IFAC World Congress on Automatic Control - Meeting Societal Challenges AMSTERDAM: ELSEVIER, 2020. 2122-2129.

BibTeX: Download