On a class ofPautomata
From MaRDI portal
Publication:4460604
DOI10.1080/0020716031000148502zbMATH Open1091.68067OpenAlexW2153990742MaRDI QIDQ4460604FDOQ4460604
Authors: Mutyam Madhu, Kamala Krithivasan 
Publication date: 18 May 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020716031000148502
Recommendations
- On the power of P automata
- Membrane Computing
- On languages of P automata
- DNA Computing
- On the computational complexity of P automata
- P automata: concepts, results, and new aspects
- P automata revisited
- scientific article; zbMATH DE number 2040914
- ON STATELESS AUTOMATA AND P SYSTEMS
- On the power of P and dP automata
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (17)
- DNA Computing
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- Title not available (Why is that?)
- A general approach for building combinationalPautomata
- On languages of P automata
- Membrane Computing
- Membrane Computing
- ON STATELESS AUTOMATA AND P SYSTEMS
- Title not available (Why is that?)
- On the computational complexity of P automata
- Membrane automata for modeling biomolecular processes
- Red–Green P Automata
- P transducers
- Title not available (Why is that?)
- A class of semisimple automata
- P automata with restricted power
- Chocolate P automata
This page was built for publication: On a class ofPautomata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4460604)
