Repetitive finite automata with translucent letters

DOI10.4204/EPTCS.407.11MaRDI QIDQ6940552zbMATH OpenFDO

Authors František Mráz, Friedrich Otto

Publication date 19 August 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.407.11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• 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 1747447 (Why is no real title available?)
• Jumping finite automata
• Jumping finite automata: characterizations and complexity
• Membership for growing context-sensitive grammars is polynomial
• Non-returning deterministic and nondeterministic finite automata with translucent letters
• Non-returning finite automata with translucent letters
• Nondeterministic right one-way jumping finite automata
• On CD-systems of stateless deterministic R-automata with window size one
• On input-revolving deterministic and nondeterministic finite automata
• One-way jumping finite automata
• Recent advances in formal languages and applications.
• Restarting automata
• Transactions on Computational Collective Intelligence XVII.

Cited in

(1)

• On languages of transduced-input finite automata with translucent letters

This page was built for publication: Repetitive finite automata with translucent letters

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