Networks of evolutionary processors: the power of subregular filters

DOI10.1007/S00236-012-0172-0zbMATH Open1272.68128OpenAlexW1985942087MaRDI QIDQ2376983FDOQ2376983

Authors Florin Manea, Bianca Truthe, Jürgen Dassow

Publication date 26 June 2013

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-012-0172-0

zbMATH Keywords

generative powernetworks of evolutionary processorssubregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Networks of evolutionary processors with subregular filters
• Accepting networks of evolutionary processors with subregular filters
• Accepting networks of evolutionary processors with subregular filters
• On the Power of Networks of Evolutionary Processors
• scientific article; zbMATH DE number 2001369
• Networks of evolutionary processors
• scientific article; zbMATH DE number 7347652
• Developments in networks of evolutionary processors
• scientific article; zbMATH DE number 2013489
• Networks of Evolutionary Picture Processors with Filtered Connections

Cites work

• scientific article; zbMATH DE number 1728707 (Why is no real title available?)
• scientific article; zbMATH DE number 4062631 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 1047924 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1860699 (Why is no real title available?)
• scientific article; zbMATH DE number 3293675 (Why is no real title available?)
• Complexity in Union-Free Regular Languages
• Determination of finite automata accepting subregular languages
• Generative capacity of subregularly tree controlled grammars
• Networks of evolutionary processors
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• On Networks of Evolutionary Processors with Nodes of Two Types
• On networks of evolutionary processors with filters accepted by two-state-automata
• Quotient Complexity of Ideal Languages
• State complexity of basic operations on suffix-free regular languages
• The magic number problem for subregular language families

Cited in

(15)

• Remarks on context-free grammars with subregular control languages
• On networks of evolutionary processors with filters accepted by two-state-automata
• Accepting networks of evolutionary processors with subregular filters
• Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors
• Accepting networks of evolutionary processors with subregular filters
• Filter position in networks of evolutionary processors does not matter: a direct proof
• A survey on computationally complete accepting and generating networks of evolutionary processors
• Networks with evolutionary processors and ideals and codes as filters
• Networks of evolutionary processors
• Lindenmayer systems with control by ideals and codes
• Generative capacity of contextual grammars with subregular selection languages
• Accepting networks of evolutionary processors with resources restricted and structure limited filters
• Networks of evolutionary processors with subregular filters
• scientific article; zbMATH DE number 7347652 (Why is no real title available?)
• Filters defined by random contexts versus polarization in networks of evolutionary processors

This page was built for publication: Networks of evolutionary processors: the power of subregular filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376983)