A survey on automata with translucent letters

DOI10.1007/978-3-031-40247-0_2OpenAlexW4385701312MaRDI QIDQ6199861

Friedrich Otto

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_2

zbMATH Keywords

finite automatonincomparabilityinclusiontrace languagepushdown automatontranslucent letterlanguage class

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
• On CD-systems of stateless deterministic R-automata with window size one
• Membership for growing context-sensitive grammars is polynomial
• On input-revolving deterministic and nondeterministic finite automata
• Membership problems for regular and context-free trace languages
• Nondeterministic right one-way jumping finite automata
• Two-head finite-state acceptors with translucent letters
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• Combinatorial problems of commutation and rearrangements
• 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
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• 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
• Visibly pushdown languages
• Realizability of Concurrent Recursive Programs
• Notes on finite asynchronous automata
• JUMPING FINITE AUTOMATA
• Transduced-input Automata with Translucent Letters
• Restarting automata
• On Visibly Pushdown Trace Languages
• On 5′→3′ Sensing Watson-Crick Finite Automata
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Matrix Equations and Normal Forms for Context-Free Grammars
• Developments in Language Theory
• One-Way Jumping Finite Automata
• Properties of right one-way jumping finite automata

This page was built for publication: A survey on automata with translucent letters