A quadratic regularity test for non-deleting macro s grammars

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A quadratic regularity test is presented for non-deleting simple deterministic contextfree tree grammars as well as for non-deleting macro S grammars.

Original languageEnglish
Title of host publicationFundamentals of Computation Theory - FCT 1985
EditorsLothar Budach
PublisherSpringer Verlag
Pages422-430
Number of pages9
ISBN (Print)9783540156895
DOIs
StatePublished - 1985
Externally publishedYes
Event5th International Conference on Fundamentals of Computation Theory, FCT 1985 - Cottbus, Germany
Duration: 9 Sep 198513 Sep 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume199 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Fundamentals of Computation Theory, FCT 1985
Country/TerritoryGermany
CityCottbus
Period9/09/8513/09/85

Fingerprint

Dive into the research topics of 'A quadratic regularity test for non-deleting macro s grammars'. Together they form a unique fingerprint.

Cite this