The following pages link to (Q4074888):
Displaying 27 items.
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- Bounded Synthesis for Petri Games (Q3449635) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Facets of Synthesis: Revisiting Church’s Problem (Q3617717) (← links)
- Synthesis from Component Libraries (Q3617743) (← links)
- Monadic second order definable relations on the binary tree (Q3764124) (← links)
- On frontiers of regular trees (Q3780462) (← links)
- The recursive sets in certain monadic second order fragments of arithmetic (Q4088807) (← links)
- (Q5020999) (← links)
- Automata on infinite trees with counting constraints (Q5044742) (← links)
- (Q5090498) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- (Q5111328) (← links)
- (Q5136318) (← links)
- (Q5207047) (← links)
- (Q5207050) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- (Q5232903) (← links)
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey (Q5452198) (← links)
- Church’s Problem and a Tour through Automata Theory (Q5452202) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984) (← links)
- Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- Synthesis with privacy against an observer (Q6629463) (← links)
