MEALY MULTISET AUTOMATA

DOI10.1142/S0129054106003723zbMATH Open1088.68058WikidataQ57937256 ScholiaQ57937256MaRDI QIDQ3379516FDOQ3379516

Authors: Gabriel Ciobanu, Mihai Gontineac 

Publication date: 6 April 2006

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

Recommendations

• Membrane Computing
• Arithmetics with P-machines
• Characterizing Membrane Structures Through Multiset Tree Automata
• scientific article; zbMATH DE number 2080936
• scientific article; zbMATH DE number 2081051

zbMATH Keywords

bisimulationMealy automatamultisetsmembrane systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Evolution and observation -- a non-standard way to generate formal languages

Cited In (9)

• Characterizing Membrane Structures Through Multiset Tree Automata
• Algebraic properties of intuitionistic \(L\)-fuzzy multiset finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On fuzzy multiset automata
• Membrane Computing
• ENCODINGS OF MULTISETS
• Arithmetics with P-machines

This page was built for publication: MEALY MULTISET AUTOMATA

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