Detail výsledku
Formal Models over Free Groups
BIDLO, R.; BLATNÝ, P.; MEDUNA, A. Formal Models over Free Groups. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005. p. 193-199. ISBN: 0.
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)
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Blatný Petr, Ing., Ph.D., UIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Abstrakt
New formal models of recursively enumerable languages are introduced.Constructions of context-free and E0L grammars and two-sided pushdownautomata over free groups are presented.
Klíčová slova
free group, E0L grammar, contex-free grammar, two-sided pushdownautomata over free groups, E0L grammars over free groups, context-freegrammars over free groups
Rok
2005
Strany
193–199
Sborník
PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Konference
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science -- MEMICS 2005
Vydavatel
Faculty of Informatics MU
Místo
Brno
BibTeX
@inproceedings{BUT18275,
author="Radek {Bidlo} and Petr {Blatný} and Alexandr {Meduna}",
title="Formal Models over Free Groups",
booktitle="PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
year="2005",
pages="193--199",
publisher="Faculty of Informatics MU",
address="Brno",
isbn="0"
}
Projekty
Optimally Integrated Models of Modern Information Technologies, GAČR, Standardní projekty, GA201/04/0441, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Výzkumné skupiny
Pracoviště
Ústav informačních systémů
(UIFS)