Networks of evolutionary processors: the power of subregular filters

DOI10.1007/s00236-012-0172-0zbMath1272.68128OpenAlexW1985942087MaRDI QIDQ2376983

Florin Manea, Bianca Truthe, Juergen 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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items

Unnamed Item ⋮ Unnamed Item ⋮ Generative Capacity of Contextual Grammars with Subregular Selection Languages* ⋮ Accepting networks of evolutionary processors with subregular filters ⋮ Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors ⋮ Networks with Evolutionary Processors and Ideals and Codes as Filters ⋮ A survey on computationally complete accepting and generating networks of evolutionary processors ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State complexity of basic operations on suffix-free regular languages
• Networks of evolutionary processors
• Determination of finite automata accepting subregular languages
• THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES
• GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS
• Quotient Complexity of Ideal Languages
• Complexity in Union-Free Regular Languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• On Networks of Evolutionary Processors with Nodes of Two Types