A remark on finite transducers

DOI10.1016/S0019-9958(61)80006-5zbMath0119.13901OpenAlexW1991654872MaRDI QIDQ5730513

Schützenberger, Marcel-Paul

Publication date: 1961

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(61)80006-5

zbMATH Keywords

probability theory

Related Items

Rational equivalence relations ⋮ A simple method for building bimachines from functional finite-state transducers ⋮ Word Play ⋮ Unnamed Item ⋮ On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers ⋮ Transductions des langages de Chomsky ⋮ The halting problem for linear Turing assemblers ⋮ Parsing natural language idioms with bidirectional finite-state machines ⋮ On tree transducers for partial functions ⋮ Origin-equivalence of two-way word transducers is in PSPACE ⋮ A construction on finite automata that has remained hidden ⋮ Unnamed Item ⋮ Backward Deterministic Büchi Automata on Infinite Words