On the recognition of context-free languages using accepting hybrid networks of evolutionary processors

DOI10.1080/00207160701210760zbMath1117.68043OpenAlexW1988206220MaRDI QIDQ3446590

Florin Manea

Publication date: 19 June 2007

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701210760

zbMATH Keywords

context-free languageregular languagefinite automatonevolutionary processorpush-down automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Networks of evolutionary processors
• On the size complexity of hybrid networks of evolutionary processors
• DNA Computing
• Machines, Computations, and Universality
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the recognition of context-free languages using accepting hybrid networks of evolutionary processors