Detail výsledku

Two-Sided Pushdown Automata over Free Groups

BIDLO, R.; BLATNÝ, P. Two-Sided Pushdown Automata over Free Groups. Proceedings of the 12th Conference Student EEICT 2006 Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2006. p. 352-355. ISBN: 80-214-3163-6.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Bidlo Radek, Ing., Ph.D., UIFS (FIT)
Blatný Petr, Ing., Ph.D., UIFS (FIT)
Abstrakt

In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced over free groups rather than free monoids. It is demonstrated that these automata with pushdowns introduced in this way charakterize the family of recursively enumerable languages.

Klíčová slova

pushdown automaton, free group, two-sided pushdown automaton over a free group

Rok
2006
Strany
352–355
Sborník
Proceedings of the 12th Conference Student EEICT 2006 Volume 4
Konference
Student EEICT 2006
ISBN
80-214-3163-6
Vydavatel
Faculty of Electrical Engineering and Communication BUT
Místo
Brno
BibTeX 
@inproceedings{BUT22363,
  author="Radek {Bidlo} and Petr {Blatný}",
  title="Two-Sided Pushdown Automata over Free Groups",
  booktitle="Proceedings of the 12th Conference Student EEICT 2006 Volume 4",
  year="2006",
  pages="352--355",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="80-214-3163-6"
}
Projekty
Specifický výzkum, VUT, Vnitřní projekty VUT, SV, zahájení: 2005-01-01, ukončení: 2009-12-31, ukončen
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru