An analysis using dP automata

zbMATH Open1363.68099MaRDI QIDQ2835074

Monica Kere

Publication date: 1 December 2016

Published in: Buletinul Științific. Universitatea din Pitești. Seria Matematică și Informatică (Search for Journal in Brave)

zbMATH Keywords

boundednessreachabilityP-systemsdP-automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Ecology (92D40)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Automata and program analysis 👍 👎
• On a method of analysis of generalized automata 👍 👎
• Analyzing probabilistic pushdown automata 👍 👎
• P and dP Automata: A Survey 👍 👎
• Analysis of behaviour of automata 👍 👎

This page was built for publication: An analysis using dP automata

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