A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
From MaRDI portal
Publication:2982862
DOI10.1109/TAC.2014.2342099zbMath1360.68888OpenAlexW1987265893MaRDI QIDQ2982862
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2014.2342099
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35)
