Publication detail

Two-Sided Pushdown Automata over Free Groups

BIDLO, R. BLATNÝ, P.

Original Title

Two-Sided Pushdown Automata over Free Groups

Type

article in a collection out of WoS and Scopus

Language

English

Original 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

Authors

BIDLO, R.; BLATNÝ, P.

RIV year

2006

Released

27. 4. 2006

Publisher

Faculty of Electrical Engineering and Communication BUT

Location

Brno

ISBN

80-214-3163-6

Book

Proceedings of the 12th Conference Student EEICT 2006 Volume 4

Pages from

352

Pages to

355

Pages count

4

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