Complexity measures for binding-blocking automata

Authors:
M. Sakthi Balan
Affiliations:
E-Comm Research Lab, Infosys Technologies Limited, Electronics City, Bangalore, India
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2008

Citing 4
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Handbook of Formal Languages

Handbook of Formal Languages
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Peptide Computing - Universality and Complexity

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define three complexity measures for binding-blocking automata (BBA) namely, blocking number, blocking instant and blocking quotient. We also study some hierarchical structures of BBA arising out of it.