University of South Wales DSpace >
University of South Wales >
Advanced Technology >
Computer Science >
Please use this identifier to cite or link to this item:
|Title: ||Petri Net Controlled Finite Automata|
|Authors: ||Muller, Berndt|
|Issue Date: ||23-Apr-2012|
|Citation: ||Muller, B., Jantzen, M., Kudlek, M., Rölke, H. and Zetzsche, G. (2008) 'Petri Net Controlled Finite Automata', Fundamenta Informaticae, 85(1-4), 111-121.|
|Abstract: ||We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by *-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking, and is contained in the class of context-sensitive languages.|
|Appears in Collections:||Computer Science|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.