scientific article; zbMATH DE number 3237829
From MaRDI portal
zbMath0147.25103MaRDI QIDQ5525343
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
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, Temporal logics over linear time domains are in PSPACE, On the almighty wand, Model-theoretic complexity of automatic structures, Groups, graphs, languages, automata, games and second-order monadic logic, The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction, Inference of \(\omega\)-languages from prefixes., Absolute versus probabilistic classification in a logical setting, Linear temporal logic symbolic model checking, Inferring answers to queries, A regular characterization of graph languages definable in monadic second-order logic, Languages and scanners, Finitely generated bi\(\omega\)-languages, On automata on infinite trees, Exact complexity bounds for ordinal addition, Interval logics and their decision procedures. I: An interval logic, Monadic partition logics and finite automata, Interval logics and their decision procedures. II: A real-time interval logic, Recognizable languages in concurrency monoids, Logical definability on infinite traces, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, A denotational theory of synchronous reactive systems, Alternating automata, the weak monadic theory of trees and its complexity, Component-wise incremental LTL model checking, Synchronized rational relations of finite and infinite words, Infinite trees and automaton-definable relations over \(\omega\)-words, \(\infty\)-regular temporal logic and its model checking problem, The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, On the descriptional complexity of finite automata with modified acceptance conditions, \(X\)-automata on \(\omega\)-words, \(\omega\)-regular languages are testable with a constant number of queries, Automata on infinite objects and their applications to logic and programming, A decidability result for deterministic \(\omega\)-context-free languages, \(\omega\)-computations on deterministic pushdown machines, A theory of ultimately periodic languages and automata with an application to time granularity, A Rice-style theorem for parallel automata, An axiom system for the weak monadic second order theory of two successors, A generalization of Cobham's theorem to automata over real numbers, Mathematical logic and quantum finite state automata, Finite acceptance of infinite words, Various hierarchies of \(\omega\)-regular sets, Weighted automata and multi-valued logics over arbitrary bounded lattices, Context-free event domains are recognizable, Systolic tree \(\omega\)-languages: The operational and the logical view, Complexity and succinctness issues for linear-time hybrid logics, Dynamic linear time temporal logic, Decidable fragments of first-order temporal logics, Alternating finite automata on \(\omega\)-words, A classification of \(\omega\)-regular languages, Equivalence of infinite behavior of finite automata, Langages infinitaires et produit de mixage, Maximal serializability of iterated transactions, Infinite games played on finite graphs, A syntactic congruence for rational \(\omega\)-languages, Efficient minimization of deterministic weak \(\omega\)-automata, Logic over words on denumerable ordinals, An extension of Kleene's and Ochmański's theorems to infinite traces, Finite variability interpretation of monadic logic of order, A theory of timed automata, Refuting learning revisited., On omega context free languages which are Borel sets of infinite rank., Abstract interpretation as automated deduction, Closure properties of locally finite \(\omega\)-languages, Regular sets of infinite message sequence charts, Stable Models for Temporal Theories, Limited Set quantifiers over Countable Linear Orderings, On decidability of monadic logic of order over the naturals extended by monadic predicates, Automata Theory and Model Checking, Transfer of Model Checking to Industrial Practice, Abstract Interpretation as Automated Deduction, Complementation of rational sets on scattered linear orderings of finite rank, Rebootable and suffix-closed $\omega $-power languages, Asymptotic Monadic Second-Order Logic, Delay Games with WMSO$$+$$U Winning Conditions, Saturating right congruences, McNaughton games and extracting strategies for concurrent programs, Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization, Temporal equilibrium logic: a survey, A decidable timeout-based extension of linear temporal logic, Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations, Composition Over the Natural Number Ordering with an Extra Binary Relation, Subword Metrics for Infinite Words, A computation model with automatic functions and relations as primitive operations, Characterizing classes of regular languages using prefix codes of bounded synchronization delay, Model Theoretic Complexity of Automatic Structures (Extended Abstract), Unary Automatic Graphs: An Algorithmic Perspective, Linear-Time Model Checking: Automata Theory in Practice, Weighted Automata and Weighted Logics with Discounting, Sequential mappings of $\omega $-languages, On Second-Order Monadic Groupoidal Quantifiers, Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Uncountable automatic classes and learning, On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases, Quantitative vs. weighted automata, The additive structure of integers with the lower Wythoff sequence, Unnamed Item, Complexity and Succinctness Issues for Linear-Time Hybrid Logics, On the representation of finite deterministic 2-tape automata, Distributed synthesis is simply undecidable, The complexity of computing the behaviour of lattice automata on infinite trees, Model Transformations in Decidability Proofs for Monadic Theories, Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract), A characterization of definability of second-order generalized quantifiers with applications to non-definability, Büchi Store: An Open Repository of Büchi Automata, A note on undecidable extensions of monadic second order successor arithmetic, The recursive sets in certain monadic second order fragments of arithmetic, Certifying inexpressibility, A design of GPU-based quantitative model checking, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, A complete characterization of deterministic regular liveness properties, Regular Languages of Words over Countable Linear Orderings, Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts, Rabin's theorem in the concurrency setting: a conjecture, Model-theoretic properties of \(\omega\)-automatic structures, Decidability of infinite-state timed CCP processes and first-order LTL, Monotonic hybrid systems, The Quest for a Tight Translation of Büchi to co-Büchi Automata, On Monadic Theories of Monadic Predicates, Weak Muller acceptance conditions for tree automata, How to avoid a compact set, Iterated pushdown automata and sequences of rational numbers, Timer formulas and decidable metric temporal logic, Verification of concurrent programs: The automata-theoretic framework, UNITY and Büchi automata, Multi-buffer simulations: decidability and complexity, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, A tetrachotomy for expansions of the real ordered additive group, Facets of Synthesis: Revisiting Church’s Problem, Büchi Complementation and Size-Change Termination, Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization, Model checking for hybrid branching-time logics, Partially Ordered Two-Way Büchi Automata, Unnamed Item, Unnamed Item, Quantifier Alternation for Infinite Words, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, Temporal logic with recursion, Parameterized Complexity Results for 1-safe Petri Nets, Weighted versus Probabilistic Logics, Combining temporal logic systems, Decidability results for metric and layered temporal logics, Characterization of \(\omega\)-regular languages by monadic second-order formulas, On the complementation of Büchi automata, \( \omega \)-automata, Automata on infinite trees, The factorisation forest theorem, An automata-theoretic approach to model-checking systems and specifications over infinite data domains, Automata techniques for query inference machines, From complementation to certification, Relating word and tree automata, A logical characterization of data languages., Automata, Boolean matrices, and ultimate periodicity., Star-free sets of words on ordinals, The monadic theory of morphic infinite words and generalizations, A second-order formulation of non-termination, A link between multioperator and tree valuation automata and logics, Shelah-Stupp's and Muchnik's iterations revisited, Shift-invariant topologies for the Cantor space \(X^{\omega}\)
