A general approach for building combinationalPautomata

DOI10.1080/00207160701326764zbMath1147.68044OpenAlexW2020497406MaRDI QIDQ5431615

Yuxi Fu, Huan Long

Publication date: 12 December 2007

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

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

zbMATH Keywords

membrane computingregular expressionP automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition ⋮ Membrane automata for modeling biomolecular processes

Cites Work

• Unnamed Item
• Trading polarizations for labels in P systems with active membranes
• P systems with symport/antiport simulating counter automata

This page was built for publication: A general approach for building combinationalPautomata