scientific article

zbMath0315.02037MaRDI QIDQ4074888

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (75)

Effective Synthesis of Asynchronous Systems from GR(1) Specifications ⋮ Matching regular expressions on uncertain data ⋮ Hierarchical information and the synthesis of distributed strategies ⋮ Finite-memory automata ⋮ Automata-theoretic techniques for modal logics of programs ⋮ Automated Synthesis of Distributed Controllers ⋮ On Determinisation of Good-for-Games Automata ⋮ Bounded Synthesis for Petri Games ⋮ Minimum Attention Controller Synthesis for Omega-Regular Objectives ⋮ Introduction to Model Checking ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Chain automata ⋮ Robust learning of automatic classes of languages ⋮ Compositional Control Synthesis for Partially Observable Systems ⋮ On control of systems modelled as deterministic Rabin automata ⋮ The monadic second-order logic of graphs, II: Infinite graphs of bounded width ⋮ On Distributed Monitoring and Synthesis ⋮ Complementing deterministic Büchi automata in polynomial time ⋮ Unnamed Item ⋮ On the relation between reactive synthesis and supervisory control of non-terminating processes ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Determinization of ordinal automata ⋮ Control of $\omega$-automata under state fairness assumptions ⋮ Automata-theoretic decision of timed games ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ On branching and looping. I ⋮ Monadic second order definable relations on the binary tree ⋮ Finite automata on timed $\omega$-trees ⋮ Logics for unordered trees with data constraints ⋮ Supervisory control and reactive synthesis: a comparative introduction ⋮ Improved complexity analysis of quasi-polynomial algorithms solving parity games ⋮ Decidability of well-connectedness for distributed synthesis ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ On frontiers of regular trees ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Synthesis of Reactive(1) designs ⋮ Observation and distinction: representing information in infinite games ⋮ Unnamed Item ⋮ Distributed synthesis is simply undecidable ⋮ $\omega$-languages accepted by finite automata whose structures are cascade products o resets ⋮ The recursive sets in certain monadic second order fragments of arithmetic ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra ⋮ Finite automata on directed graphs ⋮ Synthesis of deterministic top-down tree transducers from automatic tree relations ⋮ Rabin's uniformization problem ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ The Borel hierarchy is infinite in the class of regular sets of trees ⋮ Theories of automata on $\omega$-tapes: a simplified approach ⋮ Weak Muller acceptance conditions for tree automata ⋮ Mit regulären Grundbegriffen definierbare Prädikate ⋮ Unnamed Item ⋮ From Philosophical to Industrial Logics ⋮ Automata on infinite trees with counting constraints ⋮ Counting branches in trees using games ⋮ 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 ⋮ Facets of Synthesis: Revisiting Church’s Problem ⋮ Synthesis from Component Libraries ⋮ Unnamed Item ⋮ Monoidal-closed categories of tree automata ⋮ Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time ⋮ Unnamed Item ⋮ Query inseparability for $\mathcal{ALC}$ ontologies ⋮ A classification of $\omega$-regular languages ⋮ Characterization of $\omega$-regular languages by first-order formulas ⋮ Synthesizing structured reactive programs via deterministic tree automata ⋮ Decidability and undecidability of theories with a predicate for the primes ⋮ Synthesis in presence of dynamic links ⋮ Towards Property Oriented Testing ⋮ The monadic second-order logic of graphs. IV: Definability properties of equational graphs ⋮ Compositional construction of most general controllers

This page was built for publication: