Jump complexity of deterministic finite automata with translucent letters

DOI10.1007/978-3-031-77019-7_4MaRDI QIDQ6979831zbMATH OpenFDO

Authors Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Păun, Mihaela Păun

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-77019-7_4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A survey on automata with translucent letters
• Complexities for jumps and sweeps
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Jump complexity of finite automata with translucent letters
• Jumping finite automata
• On input-revolving deterministic and nondeterministic finite automata
• On the degrees of non-regularity and non-context-freeness
• On the group memory complexity of extended finite automata over groups
• One-way jumping finite automata
• Two-way deterministic automata with jumping mode

Cited in

(1)

• Subsequence matching and analysis problems for automata with translucent letters

This page was built for publication: Jump complexity of deterministic finite automata with translucent letters

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