State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134): Difference between revisions

Latest revision as of 20:33, 29 August 2024

scientific article; zbMATH DE number 7828948

Language	Label	Description	Also known as
English	State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters	scientific article; zbMATH DE number 7828948

Statements

instance of

scholarly article

0 references

title

State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (English)

0 references

author

Benedek Nagy

0 references

published in

Electronic Proceedings in Theoretical Computer Science

0 references

publication date

9 April 2024

0 references

full work available at URL

https://arxiv.org/abs/2309.02759

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Developments in Language Theory

0 references

Combinatorial problems of commutation and rearrangements

0 references

One-Way Jumping Finite Automata

0 references

Transduced-input Automata with Translucent Letters

0 references

0 references

0 references

0 references

0 references

Classifying invariant structures of step traces

0 references

A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model

0 references

Linear Context Free Languages

0 references

Q4500369

0 references

JUMPING FINITE AUTOMATA

0 references

On 5′→3′ Sensing Watson-Crick Finite Automata

0 references

Q3589634

0 references

Q2819407

0 references

On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages

0 references

State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata

0 references

Trajectories and Traces on Non-traditional Regular Tessellations of the Plane

0 references

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages

0 references

An Automata-Theoretical Characterization of Context-Free Trace Languages

0 references

Globally Deterministic CD-Systems of Stateless R(1)-Automata

0 references

On CD-systems of stateless deterministic R-automata with window size one

0 references

Globally deterministic CD-systems of stateless R-automata with window size 1

0 references

Linear automata with translucent letters and linear context-free trace languages

0 references

On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN

0 references

\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter

0 references

Q5016370

0 references

Recent advances in formal languages and applications.

0 references

Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter

0 references

Q4223673

0 references

Identifiers

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6204134

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