scientific article; zbMATH DE number 7354705
From MaRDI portal
Publication:4991691
zbMath1461.68105MaRDI QIDQ4991691
Michael O. Rabin, Dana S. Scott
Publication date: 3 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Zur Theorie abstrakter stochastischer Automaten, Unrecognizable Sets of Numbers, Translating regular expressions into small ε-free nondeterministic finite automata, A Theory of Computer Instructions, On the Size of Two-Way Reasonable Automata for the Liveness Problem, Multi-Valued Reasoning about Reactive Systems, Finite automata and unary languages, Interleaving isotactics -- an equivalence notion on behaviour abstractions, Expression-Based Aliasing for OO–languages, Tree automata and pigeonhole classes of matroids. I, Rational and Recognisable Power Series, Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats, On the equivalence problem for deterministic multitape automata and transducers, On the decidability of the valuedness problem for two-way finite transducers, On the Hierarchy of Block Deterministic Languages, More on Deterministic and Nondeterministic Finite Cover Automata, From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods, Structured Frequency Algorithms, The fully compressed subgroup membership problem, Improved complement for two-way alternating automata, Liveness in broadcast networks, Language recognition power and succinctness of affine automata, Logical omniscience, On the Complexity of String Matching for Graphs, Nondeterministic operational complexity in subregular languages, Unnamed Item, Weighted two-way transducers, Runtime Verification with Imperfect Information Through Indistinguishability Relations, State-based opacity of labeled real-time automata, Weighted two-way transducers, The different shades of infinite session types, Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification, Two-Way Non-Uniform Finite Automata, Unnamed Item, On Jaffe's pumping lemma, revisited, Complexity of exclusive nondeterministic finite automata, A language-based diagnosis framework for permanent and intermittent faults, Algorithm for establishing the equivalence of deterministic multitape automata, Quantitative vs. weighted automata, Unnamed Item, On the average complexity of partial derivative transducers, Nondeterministic Moore automata and Brzozowski's minimization algorithm, Unnamed Item, More Concise Representation of Regular Languages by Automata and Regular Expressions, On the State Complexity of Operations on Two-Way Finite Automata, Multilinear representations of free pros, Deterministic Input-Reversal and Input-Revolving Finite Automata, Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal, Head and state hierarchies for unary multi-head finite automata, Reordering Derivatives of Trace Closures of Regular Languages., Copyless cost-register automata: structure, expressiveness, and closure properties, ptype: probabilistic type inference, New operations and regular expressions for two-dimensional languages over one-letter alphabet, The epistemology of nondeterminism, Program schemata as automata. I, Classes of discrete optimization problems and their decision problems, Decomposition theorems for finite sequential machines, State complexity of binary coded regular languages, Noiselike transforms of \(\omega\)-events, Unnamed Item, Unnamed Item, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity, Unnamed Item, An Automata Theoretic Approach to Rational Tree Relations, A logical and graphical framework for reaction systems, Unnamed Item, Church’s Problem and a Tour through Automata Theory, From Monadic Logic to PSL, Automata-Theoretic Model Checking Revisited, Lattice Automata, Determinizing monitors for HML with recursion, The descriptional power of queue automata of constant length, Finite sequentiality of unambiguous max-plus tree automata, Bracketed context-free languages, Planning to Chronicle, Robust biomolecular finite automata, Minimizing GFG Transition-Based Automata, Probabilistic tree automata and context free languages, From Nondeterministic to Multi-Head Deterministic Finite-State Transducers, Multitape finite automata with rewind instructions, An Overview of Synchronous Communication for Control of Decentralized Discrete-Event Systems, A Characterisation of Pi^0_2 Regular Tree Languages, Unambiguity in Automata Theory, The State Complexity of Permutations on Finite Languages over Binary Alphabets, Solving string problems on graphs using the labeled direct product, Deterministic one-way simulation of two-way deterministic finite automata over small alphabets, Disambiguation of weighted tree automata, On the Class of Predicates Decidable by Two-Way Multitape Finite Automata, Complete system of equivalent transformations for two-tape automata with disjoint loops, Context-free coalgebras, The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints, Converting nondeterministic two-way automata into small deterministic linear-time machines, Not by equations alone: Reasoning with extensible effects, Unnamed Item, Backward Deterministic Büchi Automata on Infinite Words, State complexity of binary coded regular languages, Operations on subregular languages and nondeterministic state complexity, Construction of a minimal realization and monoid for a fuzzy language: a categorical approach, Iterative pairs and multitape automata, Jump complexity of finite automata with translucent letters, Binary coded unary regular languages, Two-way machines and de Bruijn words, SySCoRe: Synthesis via Stochastic Coupling Relations, On Minimal Pumping Constants for Regular Languages, Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings, Once-Marking and Always-Marking 1-Limited Automata
