State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

DOI10.4204/eptcs.386.14arXiv2309.02759OpenAlexW4386400118MaRDI QIDQ6204134

Benedek Nagy

Publication date: 9 April 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On CD-systems of stateless deterministic R-automata with window size one
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• Classifying invariant structures of step traces
• Recent advances in formal languages and applications.
• Combinatorial problems of commutation and rearrangements
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• Globally deterministic CD-systems of stateless R-automata with window size 1
• Globally Deterministic CD-Systems of Stateless R(1)-Automata
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• Linear automata with translucent letters and linear context-free trace languages
• Linear Context Free Languages
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• JUMPING FINITE AUTOMATA
• Transduced-input Automata with Translucent Letters
• Trajectories and Traces on Non-traditional Regular Tessellations of the Plane
• On 5′→3′ Sensing Watson-Crick Finite Automata
• Developments in Language Theory
• One-Way Jumping Finite Automata
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
• \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter

This page was built for publication: State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters