Reversible Watson-Crick automata (Q2406432)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Reversible Watson-Crick automata	scientific article

Statements

scholarly article

0 references

Reversible Watson-Crick automata (English)

0 references

zbMATH Open document ID

0 references

10.1007/s00236-016-0267-0

0 references

Kingshuk Chatterjee

0 references

Kumar Sankar Ray

0 references

Acta Informatica

0 references

publication date

29 September 2017

0 references

full work available at URL

https://arxiv.org/abs/1507.05283

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Logical Reversibility of Computation

0 references

Two-Way Reversible Multi-Head Finite Automata

0 references

One-Way Reversible Multi-head Finite Automata

0 references

Reversible pushdown automata

0 references

0 references

0 references

0 references

On the descriptional complexity of Watson-Crick automata

0 references

0 references

State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata

0 references

Developments in Language Theory

0 references

<i>k</i> + 1 Heads Are Better than <i>k</i>

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2406432

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2406432&oldid=36347932"