scientific article; zbMATH DE number 3566194

MaRDI QIDQ4138161zbMATH OpenFDO

Authors Michal Chytil, V. J. Ja'kl

Publication date 1977

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(14)

• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• Tree transducers, L systems, and two-way machines
• The power of two-way deterministic checking stack automata
• Aperiodic string transducers
• Three hierarchies of transducers
• Register Transducers Are Marble Transducers
• Sequentiality of string-to-context transducers
• Pebble minimization: the last theorems
• Transducers of polynomial growth
• What you must remember when transforming datawords
• Single-use automata and transducers for infinite alphabets
• Polyregular functions: characterisations and refutations
• Reversible pebble transducers
• Two-way pebble transducers for partial functions and their composition

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