scientific article; zbMATH DE number 4131674

MaRDI QIDQ3033335zbMATHFDO

Authors V. Yu. Kirillov

Publication date 1988

zbMATH Keywords

finite automataPetri netsequivalent transformationsdescription of languagesliveliness conditions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Petri net controlled finite automata
• Interpreted nets
• scientific article; zbMATH DE number 3843142
• scientific article; zbMATH DE number 3885321
• From Petri nets to automata with concurrency

Cited in

(8)

• scientific article; zbMATH DE number 2088664 (Why is no real title available?)
• Identification of labeled Petri nets from finite automata
• Petri net controlled finite automata
• From Petri nets to automata with concurrency
• Logical representation of algorithmic systems by the Petri-Chomsky machine
• Petri Automata for Kleene Allegories
• scientific article; zbMATH DE number 1931946 (Why is no real title available?)
• Interpreted nets

This page was built for publication:

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