Abstract is missing.
- SAT-Based Invariant Inference and Its Relation to Concept LearningYotam M. Y. Feldman, Sharon Shoham. 3-27 [doi]
- Post's Correspondence Problem: From Computer Science to AlgebraLaura Ciobanu. 28-36 [doi]
- The Past and Future of Embedded Finite Model TheoryMichael Benedikt. 37-46 [doi]
- Linearization, Model Reduction and Reachability in Nonlinear odesMichele Boreale, Luisa Collodi. 49-66 [doi]
- History-Deterministic Timed Automata Are Not DeterminizableSougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke. 67-76 [doi]
- Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite AutomataTomoyuki Yamakami. 77-92 [doi]
- The Stochastic Arrival ProblemThomas Webster. 93-107 [doi]
- On Higher-Order Reachability Games Vs May ReachabilityKazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi 0001. 108-124 [doi]
- Coefficient Synthesis for Threshold AutomataA. R. Balasubramanian. 125-139 [doi]
- Subsequences in Bounded Ranges: Matching and Analysis ProblemsMaria Kosche, Tore Koß, Florin Manea, Viktoriya Pak. 140-159 [doi]
- Canonization of Reconfigurable PT Nets in MaudeLorenzo Capra. 160-177 [doi]