Publication:4385530
From MaRDI portal
zbMath0900.68316MaRDI QIDQ4385530
Publication date: 14 May 1998
68Q45: Formal languages and automata
Related Items
Construction of a Deterministicω-Automaton Using Derivatives, Unnamed Item, On global induction mechanisms in aμ-calculus with explicit approximations, Permissive strategies: from parity games to safety games, On the Topological Complexity of Infinitary Rational Relations, Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations, Computing the Rabin Index of a Parity Automaton, Deciding inclusion of set constants over infinite non-strict data structures, From LTL to Symbolically Represented Deterministic Automata, On Verifying Fault Tolerance of Distributed Protocols, On Decision Problems for Probabilistic Büchi Automata, Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers, Recasting Constraint Automata into Büchi Automata, Unification of concept terms in description logics, Locally finite languages, Topological properties of omega context-free languages, Wadge hierarchy of omega context-free languages, On control of systems modelled as deterministic Rabin automata, McNaughton games and extracting strategies for concurrent programs, Supervisory control of discrete event systems, Bounded model checking of infinite state systems, Alternating two-way AC-tree automata, The Kolmogorov complexity of infinite words, The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, Infinite fuzzy computations, Concurrent reachability games, A complete characterization of deterministic regular liveness properties, Symbolic graphs: Linear solutions to connectivity related problems, The stuttering principle revisited, On the \(\omega\)-language expressive power of extended Petri nets, Definability and decidability of binary predicates for time granularity, Tree regular model checking: a simulation-based approach, Set constraints with intersection, An expressively complete linear time temporal logic for Mazurkiewicz traces, The recognizability of sets of graphs is a robust property, A theory of regular MSC languages, Verification of probabilistic systems with faulty communication, Relating word and tree automata, Weighted Automata and Weighted Logics with Discounting, How We Think of Computing Today, On the continuity set of an Omega rational function, Learning Meets Verification, Complexity of Topological Properties of Regular ω-Languages, Practical Efficient Modular Linear-Time Model-Checking, Automated Compositional Reasoning of Intuitionistically Closed Regular Properties, Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata, On Omega-Languages Defined by Mean-Payoff Conditions, Highly Undecidable Problems For Infinite Computations, Fairness and regularity for SCCS processes, Algorithmic uses of the Feferman-Vaught theorem, Interval logics and their decision procedures. I: An interval logic, Monadic partition logics and finite automata, A topological property of rational \(\omega\)-languages, The monadic second-order logic of graphs. IX: Machines and their behaviours, An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma, Logical definability on infinite traces, Synchronized rational relations of finite and infinite words, Safety and liveness of \(\omega\)-context-free languages, Towards a descriptive set theory for domain-like structures, Vertex-minors, monadic second-order logic, and a conjecture by Seese, Automata on linear orderings, On decidability properties of local sentences, Observations on determinization of Büchi automata, Skew and infinitary formal power series, An automata-theoretic approach to constraint LTL, Inferring answers to queries, Computation in finitary stochastic and quantum processes, Topological complexity of locally finite \(\omega\)-languages, Verification of well-formed communicating recursive state machines, Fine hierarchies and m-reducibilities in theoretical computer science, Finite automata encoding geometric figures, Processes with local and global liveness requirements, Topology on words, 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 \(\omega\)-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 \(\omega\)-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 \(\omega\)-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, 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
