Bibliography

Petri Net Controlled Finite Automata

Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, and Georg Zetzsche.
Petri net controlled finite automata.
Fundamenta Informaticae, 85(1-4):111-121, 2008.

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 l-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.

BibTeX

@Article{Farwer+08,
  author =  {Farwer, Berndt and Jantzen, Matthias and Kudlek, Manfred
                  and R{\"o}lke, Heiko and Zetzsche, Georg},
  title =  {{Petri} Net Controlled Finite Automata},
  year =  2008,
  journal =  {Fundamenta Informaticae},
  volume =  85,
  number =  {1-4},
  pages =  {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
                  l-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.}
}