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

DOI10.4204/EPTCS.386.14MaRDI QIDQ6204134zbMATH OpenOpenAlexFDO

Authors 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

• 5' 3' Watson-Crick automata languages-without sensing parameter
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• Classifying invariant structures of step traces
• Combinatorial problems of commutation and rearrangements
• Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
• Developments in Language Theory
• 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 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1342112 (Why is no real title available?)
• scientific article; zbMATH DE number 1501609 (Why is no real title available?)
• scientific article; zbMATH DE number 7444011 (Why is no real title available?)
• scientific article; zbMATH DE number 5051573 (Why is no real title available?)
• Jumping finite automata
• Languages generated by context-free grammars extended by type \(AB\to BA\) rules
• Linear automata with translucent letters and linear context-free trace languages
• Linear Context Free Languages
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
• On CD-systems of stateless deterministic R(2)-automata
• On CD-systems of stateless deterministic R-automata with window size one
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• One-way jumping finite automata
• Recent advances in formal languages and applications.
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
• Trajectories and Traces on Non-traditional Regular Tessellations of the Plane
• Transduced-input automata with translucent letters

Cited in

(4)

• Quasi-deterministic finite one-head and two-head automata
• Finite automata with sets of translucent words
• 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: State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

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