Finite automata with sets of translucent words

DOI10.1007/978-3-031-66159-4_17MaRDI QIDQ7034828zbMATH OpenFDO

Authors Benedek Nagy, Friedrich Otto

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-66159-4_17

zbMATH Keywords

closure propertyfinite automatonhierarchylanguage classtranslucent letter

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A survey on automata with translucent letters
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• Globally deterministic CD-systems of stateless R(1)-automata
• Globally deterministic CD-systems of stateless R-automata with window size 1
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Jumping finite automata
• Jumping finite automata: characterizations and complexity
• On CD-systems of stateless deterministic R-automata with window size one
• Restarting automata
• State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

Cited in

(4)

• On a measure for the descriptional complexity of finite automata with translucent words
• Two-way finite automata with translucent input letters
• On languages of transduced-input finite automata with translucent letters
• A two-dimensional infinite hierarchy for finite automata with translucent words

This page was built for publication: Finite automata with sets of translucent words

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