Result Details

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.

Type

conference paper

Language

English

Authors

Bidlo Radek, Ing., Ph.D., DIFS (FIT)
Blatný Petr, Ing., Ph.D., DIFS (FIT)

Abstract

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.

Keywords

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

Published

2006

Pages

352–355

Proceedings

Proceedings of the 12th Conference Student EEICT 2006 Volume 4

Conference

Student EEICT 2006

ISBN

80-214-3163-6

Publisher

Faculty of Electrical Engineering and Communication BUT

Place

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"
}

Projects

Specifický výzkum, BUT, Vnitřní projekty VUT, SV, start: 2005-01-01, end: 2009-12-31, completed

Departments

Department of Information Systems (DIFS)