An aqueous algorithm for finding the bijections contained in a binary relation

Authors:
Tom Head
Affiliations:
Mathematical Sciences, Binghamton University, Binghamton, New York
Venue:
Formal and natural computing
Year:
2002

Citing 9
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Writing by methylation proposed for aqueous computing

Where mathematics, computer science, linguistics and biology meet
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing

Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Biomolecular realizations of a parallel architecture for solving combinatorial problems

New Generation Computing
Computing with Bio-Molecules: Theory and Experiments

Computing with Bio-Molecules: Theory and Experiments
Unconventional Models of Computation

Unconventional Models of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Splicing Systems, Aqueous Computing, and Beyond

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Balanced grammars are a generalization of parenthesis grammars in two directions. First, several kind of parentheses are allowed. Next, the set of right-hand sides of productions may be an infinite regular language. XML-grammars are a special kind of ...