Abstract is missing.
- On Decision Problems for Substitutions in Symbolic DynamicsValérie Berthé. 3-19 [doi]
- Games with Full, Longitudinal, and Transverse ObservabilityOrna Kupferman. 20-34 [doi]
- Reachability Set Generation Using Hybrid Relation Compatible SaturationShruti Biswal, Andrew S. Miner. 37-51 [doi]
- Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control ModelSergiy Bogomolov, Marcelo Forets, Kostiantyn Potomkin. 52-66 [doi]
- Qualitative Multi-objective Reachability for Ordered Branching MDPsKousha Etessami, Emanuel Martinov. 67-82 [doi]
- Quantum-over-Classical Advantage in Solving Multiplayer GamesDmitry Kravchenko, Kamil Khadiev, Danil Serov, Ruslan Kapralov. 83-98 [doi]
- Efficient Restrictions of Immediate Observation Petri NetsMichael Raskin, Chana Weil-Kennedy. 99-114 [doi]
- Binary Expression of Ancestors in the Collatz GraphTristan Stérin. 115-130 [doi]
- The Collatz Process Embeds a Base Conversion AlgorithmTristan Stérin, Damien Woods. 131-147 [doi]
- The Complexity of the Label-Splitting-Problem for Flip-Flop-NetsRonny Tredup. 148-163 [doi]