A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages

DOI10.1109/TAC.2014.2342099MaRDI QIDQ2982862zbMATH OpenOpenAlexFDO

Authors Rong Su

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On computation of supremal controllable, normal sublanguages
• A Note on the Properties of the Supremal Controllable Sublanguage in Pushdown Systems
• scientific article; zbMATH DE number 3858445
• Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
• scientific article; zbMATH DE number 1059896
• Polynomial identification in the limit of substitutable context-free languages
• Algorithmically broad languages for polynomial time and space
• Formulas for calculating supremal controllable and normal sublanguages
• Nondeterministic operational complexity in subregular languages

Cited in

(1)

• On computation of supremal controllable, normal sublanguages

This page was built for publication: A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982862)