Bibliography

Concurrent Finite Automata

Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
Concurrent finite automata.
In Manfred Droste and Markus Lohrey, editors, Tagungsband 17. Theorietag Automaten und Formale Sprachen, pages 84-88, 2007.

Abstract: We present a generalization of finite automata using Petri nets as control. Acceptance is defined by final markings of the Petri net. The class of languages obtained by $\lambda$-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking.

BibTeX entry

@INPROCEEDINGS{Jantzen+07b,
  AUTHOR =  {Jantzen, Matthias and Kudlek, Manfred and
                  Zetzsche, Georg},
  TITLE =  {Concurrent Finite Automata},
  EDITOR =  {Droste, Manfred and Lohrey, Markus},
  BOOKTITLE =  {Tagungsband 17. Theorietag Automaten und Formale
                  Sprachen},
  PAGES =  {84--88},
  YEAR =  2007,
  ABSTRACT =  {We present a generalization of finite automata using
                  Petri nets as control. Acceptance is defined by final
                  markings of the Petri net. The class of languages
                  obtained by $\lambda$-free concurrent finite automata
                  contains both the class of regular sets and the class of
                  Petri net languages defined by final marking.}
}

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.