Iterated TGR languages: membership problem and effective closure properties

Authors:
Ian McQuillan;Kai Salomaa;Mark Daley
Affiliations:
Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada;School of Computing, Queen’s University, Kingston, Ontario, Canada;Department of Computer Science and Department of Biology, University of Western Ontario, London, Ontario, Canada
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 7
Cited 4

Iterated stack automata and complexity classes

Information and Computation
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Automata, Languages, and Machines

Automata, Languages, and Machines
The ld and dlad bio-operations on formal languages

Journal of Automata, Languages and Combinatorics
Template-guided DNA recombination

Theoretical Computer Science - Descriptional complexity of formal systems

Equivalence in template-guided recombination

Natural Computing: an international journal
Formal Language Tools for Template-Guided DNA Recombination

Language and Automata Theory and Applications
Minimality in template-guided recombination

Information and Computation
Equivalence in template-guided recombination

DNA13'07 Proceedings of the 13th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that membership is decidable for languages defined by iterated template-guided recombination systems when the set of templates is regular and the initial language is context-free. Using this result we show that when the set of templates is regular and the initial language is context-free (respectively, regular) we can effectively construct a pushdown automaton (respectively, finite automaton) for the corresponding iterated template-guided recombination language.