Two-head finite-state acceptors with translucent letters

DOI10.1007/978-3-030-10801-4_32zbMath1444.68099OpenAlexW2910606239MaRDI QIDQ2206248

Benedek Nagy, Friedrich Otto

Publication date: 22 October 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-10801-4_32

zbMATH Keywords

trace languagelinear context-free languagesemi-linear Parikh settranslucent lettertwo-head finite-state acceptor

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ Unnamed Item ⋮ A survey on automata with translucent letters ⋮ Sweep complexity revisited ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

This page was built for publication: Two-head finite-state acceptors with translucent letters