scientific article; zbMATH DE number 3254905

zbMATH Open0158.25404MaRDI QIDQ5541339FDOQ5541339

Authors: Michael O. Rabin, Dana Scott

Publication date: 1959

Title of this publication is not available (Why is that?)

zbMATH Keywords

mathematical logic

Cited In (only showing first 100 items - show all)

A characterization of automata and a direct product decomposition
Sequential fuzzy system identification
The Complexity of Languages Resulting from the Concatenation Operation
Automata theory and model checking
Modeling of RNA secondary structures using two-way quantum finite automata
Some decision problems concerning sequential transducers and checking automata
On the transformation semigroups of finite automata
The problem of equivalent transformations for homogeneous multitape automata
Alternating states for dual nondeterminism in imperative programming
The finite automata approaches in stringology
A note on autodense related languages
Title not available (Why is that?)
Automata theory and control theory - a rapprochement
System identification via state characterization
On size reduction techniques for multitape automata
Solvable classes of discrete dynamic programming
Projections of languages recognizable by probabilistic and alternating finite multitape automata
Modelization of deterministic rational relations
Quasi-automatic semigroups
A hierarchy of deterministic languages
Maximin, Minimax, and composite sequential machines
Finite transducers and rational transductions
Multiplicities: A deterministic view of nondeterminism
Quasiidentities in a free semigroup
Nondeterministic complexity in subclasses of convex languages
Alternation and bounded concurrency are reverse equivalent.
Prefix-free languages: left and right quotient and reversal
The complexity of concatenation on deterministic and alternating finite automata
On the representation of finite deterministic 2-tape automata
Concatenation of Regular Languages and Descriptional Complexity
Decision problems among the main subfamilies of rational relations
On the power of two-way multihead quantum finite automata
Direct and subdirect product structure theorems for non-deterministic automata
Profile trees for Büchi word automata, with application to determinization
Domain mu-calculus
The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
Equivalence of regular expressions over a partially commutative alphabet
On input-revolving deterministic and nondeterministic finite automata
Endmarkers can make a difference
New techniques for proving the decidability of equivalence problem
Parallel complexity of the regular code problem
Vector addition systems and regular languages
Polynomial algorithm for equivalence problem of deterministic multitape finite automata
Equivalence of infinite behavior of finite automata
On inclusion problem for deterministic multitape automata
Fuzzy neural networks
Finite automata with multiplication
A note on Parikh maps, abstract languages, and decision problems
On a subclass of \(\infty\)-regular languages
Operations on Permutation Automata
Controlled pushdown automata
Finite automata on directed graphs
Title not available (Why is that?)
A note on decision problems for three-way two-dimensional finite automata
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
Notes on finitely generated semigroups and pumping conditions for regular languages
Substitution in families of languages
AFL with the semilinear property
State complexity of star of union and square of union on \textit{k} regular languages
State complexity of union and intersection of star on \(k\) regular languages
Reversal of binary regular languages
Loops in automata and HDTOL relations
Rewriting of regular expressions and regular path queries
Bounded Regular Sets
On Stateless Deterministic Restarting Automata
Algorithms and topology of Cayley graphs for groups.
An algebraic characterization of deterministic regular languages over infinite alphabets.
Real-time computations with restricted nondeterminism
Decision Problems of Finite Automata Design and Related Arithmetics
Theories of automata on \(\omega\)-tapes: a simplified approach
Automatic construction of test sets: theoretical approach
Spiking Neural P Systems with Thresholds
The state complexity of \(L^{2}\) and \(L^k\)
Partial derivatives of regular expressions and finite automaton constructions
A note on the reduction of two-way automata to one-way automata
Size complexity of rotating and sweeping automata
Regular languages with variables on graphs
The inclusion problem for simple languages
Nondeterministic fuzzy automata
State complexity of union and intersection of square and reversal on \(k\) regular languages
Adjoint machines, state-behavior machines, and duality
Finite automata theory with membership values in lattices
On multi-head automata with restricted nondeterminism
State complexity of some operations on binary regular languages
The complexity of asynchronous model based testing
Complexity of multi-head finite automata: origins and directions
Distances between languages and reflexivity of relations
Tighter Bounds for the Determinisation of Büchi Automata
Myhill-Nerode type theory for fuzzy languages and automata
Checking experiments for stream X-machines
An alternating hierarchy for finite automata
Nondeterministic state complexity of star-free languages
Nondeterministic state complexity of star-free languages
The theory of languages
Optimal simulation of self-verifying automata by deterministic automata
Regular languages and Stone duality
Fuzzy automata and languages
Magic numbers in the state hierarchy of finite automata
The equivalence problem of multitape finite automata
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

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