Theory of tailor automata
From MaRDI portal
Publication:2315015
DOI10.1016/j.tcs.2019.02.002zbMath1423.68268OpenAlexW2911665282MaRDI QIDQ2315015
Zbigniew Bonikowski, Sebastian Sakowski, Jacek Waldmajer
Publication date: 31 July 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.02.002
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding whether a regular language is generated by a splicing system
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Simulating Boolean circuits on a DNA computer
- DNA computing, sticker systems, and universality
- Computing with membranes
- A guide to membrane computing.
- DNA computing by blocking
- Membrane computing. An introduction.
- On the splicing operation
- Infobiotics. Information in biotic systems
- The computational power of Benenson automata
- A TOUR OF REACTION SYSTEMS
- The program-size complexity of self-assembled squares (extended abstract)
- First draft of a report on the EDVAC
- THE INFERENCE BASED ON MOLECULAR COMPUTING
- Arithmetical Analysis of Biomolecular Finite Automaton
- Developments in Language Theory
- On Computable Numbers, with an Application to the Entscheidungsproblem
This page was built for publication: Theory of tailor automata
