scientific article; zbMATH DE number 3492660
From MaRDI portal
Publication:4074888
Cited in
(84)- A classification of \(\omega\)-regular languages
- Automata-theoretic techniques for modal logics of programs
- Complementing deterministic Büchi automata in polynomial time
- Control of -automata under state fairness assumptions
- On branching and looping. I
- -languages accepted by finite automata whose structures are cascade products o resets
- Finite automata on directed graphs
- The Borel hierarchy is infinite in the class of regular sets of trees
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Mit regulären Grundbegriffen definierbare Prädikate
- Finite-memory automata
- Chain automata
- Fixed point characterization of infinite behavior of finite-state systems
- Finite automata on timed \(\omega\)-trees
- Hierarchical information and the synthesis of distributed strategies
- Supervisory control and reactive synthesis: a comparative introduction
- Weak Muller acceptance conditions for tree automata
- On control of systems modelled as deterministic Rabin automata
- Decidability of well-connectedness for distributed synthesis
- Synthesis in presence of dynamic links
- On the relation between reactive synthesis and supervisory control of non-terminating processes
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Synthesizing structured reactive programs via deterministic tree automata
- Compositional construction of most general controllers
- Logics for unordered trees with data constraints
- Distributed synthesis is simply undecidable
- Robust learning of automatic classes of languages
- Observation and distinction: representing information in infinite games
- Towards property oriented testing
- Effective synthesis of asynchronous systems from GR(1) specifications
- Operator precedence languages: their automata-theoretic and logic characterization
- Decidability and undecidability of theories with a predicate for the primes
- Minimum Attention Controller Synthesis for Omega-Regular Objectives
- Introduction to model checking
- Compositional Control Synthesis for Partially Observable Systems
- On Distributed Monitoring and Synthesis
- Rabin's uniformization problem
- Automated synthesis of distributed controllers
- On Determinisation of Good-for-Games Automata
- Bounded synthesis for Petri games
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- From Philosophical to Industrial Logics
- Facets of Synthesis: Revisiting Church’s Problem
- Synthesis from Component Libraries
- Monadic second order definable relations on the binary tree
- On frontiers of regular trees
- Determinization of ordinal automata
- Automata-theoretic decision of timed games
- The recursive sets in certain monadic second order fragments of arithmetic
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Synthesis of Reactive(1) designs
- scientific article; zbMATH DE number 7455739 (Why is no real title available?)
- Automata on infinite trees with counting constraints
- Tree automata with global constraints for infinite trees
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- scientific article; zbMATH DE number 7204449 (Why is no real title available?)
- Symmetric synthesis
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Computing the width of non-deterministic automata
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- Monoidal-closed categories of tree automata
- Query learning of derived \(\omega\)-tree languages in polynomial time
- 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
- Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\mathcal {FL}_0\)
- Choice functions and well-orderings over the infinite binary tree
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Church synthesis on register automata over linearly ordered data domains
- Automated temporal reasoning about reactive systems
- An automata-theoretic approach to linear temporal logic
- Synthesis with privacy against an observer
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Synthesis with privacy against an observer
- Church synthesis on register automata over linearly ordered data domains
- Exponential time algorithms for deciding regular games
- Counting branches in trees using games
- Deciding regular games: a playground for exponential time algorithms
- Synthesising full-information protocols
- Using games and universal trees to characterise the nondeterministic index of tree languages
- Characterization of -regular languages by first-order formulas
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
- Matching regular expressions on uncertain data
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074888)
