String execution time for finite languages: max is easy, min is hard
DOI10.1016/J.AUTOMATICA.2011.06.024zbMATH Open1228.93005OpenAlexW2082516436MaRDI QIDQ642653FDOQ642653
Authors: Rong Su, Gerhard J. Woeginger 
Publication date: 27 October 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.06.024
Recommendations
Complexity and performance of numerical algorithms (65Y20) Max-plus and related algebras (15A80) Cellular automata (computational aspects) (68Q80) Hierarchical systems (93A13) Design techniques (robust design, computer-aided design, etc.) (93B51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Supervisory Control of a Class of Discrete Event Processes
- Title not available (Why is that?)
- Performance evaluation of (max,+) automata
- Supervisory control of \((\max,+)\) automata: a behavioral approach
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
- A weighted pair graph representation for reconstructibility of Boolean control networks
- Model approximation for batch flow shop scheduling with fixed batch sizes
- Analysis and control of max-plus linear discrete-event systems: an introduction
- Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates
This page was built for publication: String execution time for finite languages: max is easy, min is hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642653)
