Regulated Grammars with Leftmost Derivation

Authors:
Henning Fernau
Affiliations:
-
Venue:
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
1998

Citing 8
Cited 0

Datalog expressiveness of chain queries: grammar tools and characterizations

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On grammar and language families

Fundamenta Informaticae
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Graph-controlled grammars as language acceptors

Journal of Automata, Languages and Combinatorics
Programmed Grammars and Classes of Formal Languages

Journal of the ACM (JACM)
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
On Unconditional Transfer

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A Grammatical Approach to the LBA Problem

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate various concepts of leftmost derivation in grammars controlled by bicoloured digraphs, especially regarding their descriptive capacity. This approach allows us to unify the presentation of known results regarding especially programmed grammars and matrix grammars, and to obtain new results concerning grammars with regular control, and periodically time-variant grammars. Moreover, we get new results on leftmost derivations in conditional grammars.