scientific article; zbMATH DE number 3254905
From MaRDI portal
Publication:5541339
zbMATH Open0158.25404MaRDI QIDQ5541339FDOQ5541339
Authors: Michael O. Rabin, Dana Scott
Publication date: 1959
Title of this publication is not available (Why is that?)
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
- Translation from classical two-way automata to pebble two-way automata
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
- The operation \(\uparrow\) on formal power series
- The zig-zag power series: A two-way version of the \({}^*\) operator.
- Stone duality and the recognisable languages over an algebra
- Infinite trees and automaton-definable relations over \(\omega\)-words
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Factorization forests for infinite words and applications to countable scattered linear orderings
- From regular expressions to DFA's using compressed NFA's
- Canonical systems which produce periodic sets
- A note on undecidable properties of formal languages
- New size hierarchies for two way automata
- On the equivalence of recursive and nonrecursive Datalog programs
- Prefix-primitive annihilators of languages under some operations
- Rational relations having a rational trace on each finite intersection of rational relations
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
- Affine computation and affine automaton
- Control sets on grammars
- Magic Numbers and Ternary Alphabet
- The theory of languages
- HDTOL matching of computations of multitape automata
- The equivalence problem for deterministic two-tape automata
- On probabilistic analog automata
- Membrane automata for modeling biomolecular processes
- On a characterization of the nonregular set of primes
- REF-ARF: A system for solving problems stated as procedures
- Syntactic operators on full semiAFLs
- The inclusion problem for some classes of deterministic multitape automata
- Descriptional complexity of limited automata
- Descriptional and Computational Complexity of Finite Automata
- One way finite visit automata
- Self-verifying finite automata and descriptional complexity
- Regular canonical systems
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- A geometrical view of the determinization and minimization of finite-state automata
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
- Postfix automata
- Construction of minimal deterministic finite automata from biological motifs
- Complexity results for two-way and multi-pebble automata and their logics
- Two-way unary automata versus logarithmic space
- Concatenation of inputs in a two-way automaton
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)