Automata, Languages, and Programming.Pt.2

Track B: Logic, Semantics, Automata, and Theory of Programming.- Symmetric Groups and Quotient Complexity of Boolean Operations.- Handling Infinitely Branching WSTS.- Transducers with Origin Information.- Weak MSO+U with Path Quantifiers over Infinite Trees.- On the Decidability of MSO+U on Infinite Trees.- A Coalgebraic Foundation for Coinductive Union Types.- Turing Degrees of Limit Sets of Cellular Automata.- On the Complexity of Temporal-Logic Path Checking.- Parameterised Linearisability.- Games with a Weak Adversary.- The Complexity of Ergodic Mean-payoff Games.- Toward a Structure Theory of Regular Infinitary Trace Languages.- Unary Pushdown Automata and Straight-Line Programs.- Robustness against Power is PSpace-complete.- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic.- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs.- Coalgebraic Weak Bisimulation from Recursive Equations over Monads.- Piecewise Boolean Algebras and Their Domains.- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency.- Bisimulation Equivalence of First-Order Grammars.- Context Unification is in PSPACE.- Monodic Fragments of Probabilistic First-Order Logic.- Stability and Complexity of Minimising Probabilistic Automata.- Kleene Algebra with Equations.- All-Instances Termination of Chase is Undecidable.- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus.- On the Positivity Problem for Simple Linear Recurrence Sequences.- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences.- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words.- Hardness Results for Intersection Non-Emptiness.- Branching Bisimilarity Checking for PRS.- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs.- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints.- Distributed Computing on Core-Periphery Networks:Axiom-Based