Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

2 2008

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Petri Net Controlled Finite Automata

Farwer B., Jantzen M., Kudlek M., Rölke H., Zetzsche G.

Fundamenta Informaticae

2008

Vol. 85, nr 1-4

111-121

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.

Language Classes Defined by Concurrent Finite Automata

Jantzen M., Kudlek M., Zetzsche G.

Fundamenta Informaticae

2008

Vol. 85, nr 1-4

267-280

This paper presents results regarding the various relations among the language classes defined by Concurrent Finite Automata, relations to other language classes, as well as decidability and closure properties.