scientific article; zbMATH DE number 3237829
From MaRDI portal
Publication:5525343
zbMath0147.25103MaRDI QIDQ5525343
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
The Hybrid Plan Controller Construction for Trajectories in Sobolev Space ⋮ Measure Quantifier in Monadic Second Order Logic ⋮ On the classification of computable languages ⋮ Generalized rational relations and their logical definability ⋮ Unnamed Item ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Unnamed Item ⋮ Weighted Automata and Weighted Logics ⋮ On the Topological Complexity of Infinitary Rational Relations ⋮ Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations ⋮ From linear temporal logics to Büchi automata: the early and simple principle ⋮ An infinitary encoding of temporal equilibrium logic ⋮ Fractals and the monadic second order theory of one successor ⋮ Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words ⋮ Towards a grand unification of Büchi complementation constructions ⋮ An interval temporal logic characterization of extended \(\omega\)-regular languages ⋮ Temporal causality in reactive systems ⋮ First-order separation over countable ordinals ⋮ Universal first-order quantification over automata ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ LOGIC IN THE TRACTATUS ⋮ A MODEL-THEORETIC CHARACTERIZATION OF MONADIC SECOND ORDER LOGIC ON INFINITE WORDS ⋮ On Expressive Power of Regular Expressions over Infinite Orders ⋮ Locally finite languages ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ A Generalization of Semenov’s Theorem to Automata over Real Numbers ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Polishness of some topologies related to word or tree automata ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From Logic to Theoretical Computer Science – An Update ⋮ 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 ⋮ Minimal generators of submonoids of $A^\infty $ ⋮ Incremental reasoning on monadic second-order logics with logic programming ⋮ Automata-Theoretic Model Checking Revisited ⋮ Stone duality, topological algebra, and recognition. ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Unnamed Item ⋮ Logic and rational languages of scattered and countable series-parallel posets ⋮ Unnamed Item ⋮ On Repetition Languages ⋮ RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC ⋮ Minimizing GFG Transition-Based Automata ⋮ The Quantifier Alternation Hierarchy of Synchronous Relations ⋮ Context-free event domains are recognizable ⋮ Unnamed Item ⋮ Rabin vs. Streett Automata ⋮ Logical definability on infinite traces ⋮ Diophantine equations, Presburger arithmetic and finite automata ⋮ Tree-automatic scattered linear orders ⋮ Timed hyperproperties ⋮ Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions ⋮ Progress measures, immediate determinacy, and a subset construction for tree automata ⋮ Regular languages of thin trees ⋮ Alternation and \(\omega\)-type Turing acceptors ⋮ The complementation problem for Büchi automata with applications to temporal logic ⋮ Rabin tree automata and finite monoids ⋮ Weighted automata and weighted logics with discounting ⋮ Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ Brzozowski hierarchy of \(\omega\)-languages ⋮ On generators of rational \(\omega\)-power languages ⋮ Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ Completeness of a first-order temporal logic with time-gaps ⋮ Alternating automata on infinite trees ⋮ Finite automata and ordinals ⋮ An introduction to the regular theory of fairness ⋮ Factorisation of transition systems ⋮ LARS: a logic-based framework for analytic reasoning over streams ⋮ On a subclass of \(\infty\)-regular languages ⋮ Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) ⋮ Interpreting the monadic second order theory of one successor in expansions of the real line ⋮ On decidability properties of local sentences ⋮ Logic programming approach to automata-based decision procedures ⋮ On dynamic topological and metric logics ⋮ An automata-theoretic approach to constraint LTL ⋮ A transformation-based approach to implication of GSTE assertion graphs ⋮ Language-theoretical representations of \(\omega\)-languages ⋮ On translations of temporal logic of actions into monadic second-order logic ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Rigorous approximated determinization of weighted automata ⋮ Fuzzy alternating Büchi automata over distributive lattices ⋮ Branching-time logics with path relativisation ⋮ Topological extension of parity automata ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ Finite automata on timed \(\omega\)-trees ⋮ Ambiguity in omega context free languages ⋮ Profile trees for Büchi word automata, with application to determinization ⋮ Borel hierarchy and omega context free languages. ⋮ Unambiguous Büchi automata. ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ Büchi context-free languages
This page was built for publication:
