|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc020201,
author = {Henning Fernau},
title = {Graph-Controlled Grammars as Language Acceptors},
journal = jalc,
year = 1997,
volume = 2,
number = 2,
pages = {79--91},
keywords = {formal languages, regulated rewriting, accepting grammars},
abstract = {In this paper, we study the concept of accepting grammars
within various forms of regulated grammars like programmed
grammars, matrix (set) grammars, grammars with regular (set)
control, periodically time-variant grammars as variants of
grammars controlled by bicoloured digraphs. We focus on
their descriptive capacity. In this way, we continue our
studies of accepting grammars. Periodically time-variant
grammars yield the first example of a non-trivial
equivalence of generating and accepting mode in the absence
of appearance checkings.}
}