Non-returning deterministic and nondeterministic finite automata with translucent letters

DOI10.1051/ita/2023009arXiv2208.14729OpenAlexW4387738956MaRDI QIDQ6186539

Friedrich Otto, František Mráz

Publication date: 2 February 2024

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.14729

zbMATH Keywords

finite automatontranslucent letterlanguage class

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On CD-systems of stateless deterministic R-automata with window size one
• On input-revolving deterministic and nondeterministic finite automata
• Growing context-sensitive languages and Church-Rosser languages
• Nondeterministic right one-way jumping finite automata
• Recent advances in formal languages and applications.
• Globally deterministic CD-systems of stateless R-automata with window size 1
• Jumping Finite Automata: Characterizations and Complexity
• Globally Deterministic CD-Systems of Stateless R(1)-Automata
• Linear Context Free Languages
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• JUMPING FINITE AUTOMATA
• Restarting automata
• On 5′→3′ Sensing Watson-Crick Finite Automata
• One-Way Jumping Finite Automata
• Properties of right one-way jumping finite automata

This page was built for publication: Non-returning deterministic and nondeterministic finite automata with translucent letters