scientific article
From MaRDI portal
Publication:3325046
zbMath0538.68041MaRDI QIDQ3325046
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite automatatransducersMealy automataMoore automatatwo-tape automataacceptable setsRabin-Scott automatatransformations of automata
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (15)
The p-adic Theory of Automata Functions ⋮ Computing Petri net languages by reductions ⋮ Deterministic automata. Simulation, universality and minimality ⋮ Quantization causes waves: smooth finitely computable functions are affine ⋮ On Jaffe's pumping lemma, revisited ⋮ On Minimal Pumping Constants for Regular Languages ⋮ Analogues of quantum complementarity in the theory of automata ⋮ An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata ⋮ Two-Sided Strictly Locally Testable Languages ⋮ Computational universes ⋮ Computational complementarity and shift spaces ⋮ Transforming a single-valued transducer into a Mealy machine ⋮ Some more on the basis finite automaton ⋮ Finite nondeterministic automata: simulation and minimality ⋮ Re-describing an algorithm by Hopcroft
This page was built for publication:
