An analysis using dP automata

MaRDI QIDQ2835074zbMATH OpenFDO

Authors 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

boundednessdP-automataP-systemsreachability

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

• Analysis of behaviour of automata
• scientific article; zbMATH DE number 3903975
• On a method of analysis of generalized automata
• scientific article; zbMATH DE number 3876597
• P and dP automata: a survey
• Automata and program analysis
• Analyzing probabilistic pushdown automata
• Analysis of automata-algebraic models
• scientific article; zbMATH DE number 4189206

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)