Publication:5725991
From MaRDI portal
zbMath0116.33604MaRDI QIDQ5725991
Publication date: 1963
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, From Logic to Theoretical Computer Science – An Update, Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey, Church’s Problem and a Tour through Automata Theory, From Monadic Logic to PSL, Measuring and Synthesizing Systems in Probabilistic Environments, Unnamed Item, Unnamed Item, Combinations of Qualitative Winning for Stochastic Parity Games, Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis, Synthesis with rational environments, A survey of stochastic \(\omega \)-regular games, Finding and fixing faults, Towards a notion of unsatisfiable and unrealizable cores for LTL, Synthesis of Reactive(1) designs, Synthesis from scenario-based specifications, Synthesis of deterministic top-down tree transducers from automatic tree relations, Optimal paths in weighted timed automata, Choice functions and well-orderings over the infinite binary tree, The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, Counting branches in trees using games, Supervision based on place invariants: a survey, Synchronous counting and computational algorithm design, Fine hierarchies and m-reducibilities in theoretical computer science, Automata over continuous time, Compositional and symbolic synthesis of reactive controllers for multi-agent systems, Supervisory control and reactive synthesis: a comparative introduction, Decidability of well-connectedness for distributed synthesis, Vacuity in synthesis, Strategy synthesis for multi-dimensional quantitative objectives, Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\), Compositional construction of most general controllers, Synthesis of succinct systems, The computational complexity of scenario-based agent verification and design, Distributed synthesis is simply undecidable, Effective Synthesis of Asynchronous Systems from GR(1) Specifications, Randomization in Automata on Infinite Trees, Synthesizing Non-Vacuous Systems, Graph Games and Reactive Synthesis, On Distributed Monitoring and Synthesis, On Synthesis of Specifications with Arithmetic, Playing with Repetitions in Data Words Using Energy Games, Distributed Synthesis for Alternating-Time Logics, Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets, Facets of Synthesis: Revisiting Church’s Problem, Decidable Extensions of Church’s Problem
