scientific article; zbMATH DE number 1142314

Cited in

(only showing first 100 items - show all)

Processes with local and global liveness requirements
Topology on words
Classifying regular languages by a split game
Don't care words with an application to the automata-based approach for real addition
A topological characterization of random sequences
Fine hierarchy of regular \(\omega\)-languages
Interactive foundations of computing
On translations of temporal logic of actions into monadic second-order logic
Shuffle on trajectories: Syntactic constraints
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
A regular characterization of graph languages definable in monadic second-order logic
On automata on infinite trees
Infinite trees and automaton-definable relations over -words
Infinite hypergraphs. II: Systems of recursive equations
Sooner is safer than later
The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
The Borel hierarchy is infinite in the class of regular sets of trees
\(X\)-automata on \(\omega\)-words
Finite acceptance of infinite words
Semantics and strong sequentiality of priority term rewriting systems
The first-order theory of linear one-step rewriting is undecidable
An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
Set constraints and automata
Dynamic linear time temporal logic
On D0L systems with immigration
Infinite games played on finite graphs
A theory of timed automata
Monadic second-order definable graph transductions: a survey
Progress measures, immediate determinacy, and a subset construction for tree automata
Deterministic asynchronous automata for infinite traces
Rabin tree automata and finite monoids
Using integer programming to verify general safety and liveness properties
Finite automata and ordinals
The monadic second-order logic of graphs. X: Linear orderings
Using automata theory for characterizing the semantics of terminological cycles
Logical description of context-free graph languages
Axiomatising extended computation tree logic
Planning control rules for reactive agents
Fixed point characterization of infinite behavior of finite-state systems
On projective and separable properties
On syntactic congruences for \(\omega\)-languages
Typechecking for XML transformers
Finite automata on timed \(\omega\)-trees
Ambiguity in omega context free languages
A hierarchy of deterministic context-free \(\omega\)-languages.
Borel hierarchy and omega context free languages.
Unambiguous Büchi automata.
On temporal logic versus Datalog
A gap property of deterministic tree languages.
Query efficient implementation of graphs of bounded clique-width
Inference of -languages from prefixes.
Past pushdown timed automata and safety verification.
Structural measures for games and process control in the branch learning model
Systolic tree \(\omega\)-languages: The operational and the logical view
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Wreath product and infinite words
How to decide continuity of rational functions on infinite words
Set constraints and topology
A unified language processing methodology
Finite variability interpretation of monadic logic of order
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Level two of the quantifier alternation hierarchy over infinite words
Graded modalities in strategy logic
Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of -automata
Computational capabilities of analog and evolving neural networks over infinite input streams
Tree-shifts of finite type
Weak Muller acceptance conditions for tree automata
Decidability results for metric and layered temporal logics
The monadic second-order logic of graphs. VIII: Orientations
A characterization of Büchi tree automata
Product interval automata
Complexity of weak acceptance conditions in tree automata.
Determinization of transducers over finite and infinite words.
On infinite transition graphs having a decidable monadic theory
Sequentiality, monadic second-order logic and tree automata.
Ordering constraints over feature trees expressed in second-order monadic logic.
The monadic theory of morphic infinite words and generalizations
An operational and denotational approach to non-context-freeness
Refuting learning revisited.
On omega context free languages which are Borel sets of infinite rank.
Well-quasi-orders and regular \(\omega\)-languages
Closure properties of locally finite \(\omega\)-languages
Winning strategies for infinite games: from large cardinals to computer science extended abstract
Regular sets of infinite message sequence charts
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Local Hausdorff dimension
On control of systems modelled as deterministic Rabin automata
McNaughton games and extracting strategies for concurrent programs
Supervisory control of discrete event systems
Symbolic synthesis of masking fault-tolerant distributed programs
Beyond -regular languages: T-regular expressions and their automata and logic counterparts
Improving parity games in practice
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
On degrees of ambiguity for Büchi tree automata
Logic for \(\omega\)-pushdown automata
-automata
Automata on finite trees
Solving string problems on graphs using the labeled direct product
Synthesis in presence of dynamic links
Abstraction-based synthesis for stochastic systems with omega-regular objectives

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 Q4385530)