Transduced-input automata with translucent letters

DOI10.7546/CRABS.2020.01.04MaRDI QIDQ4971188zbMATH OpenFDO

Authors Madeeha Fatima, Benedek Nagy

Publication date 9 October 2020

Full work available at URL https://doi.org/10.7546/CRABS.2020.01.04

zbMATH Keywords

automata with translucent letterscascade automatafinite state machinesformal languagesformal linguisticsMealy automatat-input automatatransducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Linear automata with translucent letters and linear context-free trace languages
• Two-head finite-state acceptors with translucent letters
• scientific article; zbMATH DE number 3949743
• Input-Driven Queue Automata with Internal Transductions
• scientific article; zbMATH DE number 3945364

Cited in

(9)

• Two-head finite-state acceptors with translucent letters
• Linear automata with translucent letters and linear context-free trace languages
• Non-returning deterministic and nondeterministic finite automata with translucent letters
• Non-returning finite automata with translucent letters
• Quasi-deterministic 5^ 3^ Watson-Crick automata
• A survey on automata with translucent letters
• State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
• Quasi-deterministic finite one-head and two-head automata
• On languages of transduced-input finite automata with translucent letters

This page was built for publication: Transduced-input automata with translucent letters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4971188)