Block-Synchronization Context-Free Grammars

Helmut Jürgensen and Kai Salomaa
Additional contact information
Helmut Jürgensen: University of Western Ontario, Department of Computer Science
Kai Salomaa: University of Western Ontario, Department of Computer Science

A chapter in Advances in Algorithms, Languages, and Complexity, 1997, pp 111-137 from Springer

Abstract: Abstract We consider context-free type block-synchronization grammars, BSCF grammars, where independent derivations can communicate using nested synchronization conditions. We prove inclusion relations between the language families defined by grammars using, respectively, the weak and strong prefix- or equality-synchronized derivation mode. In particular, the weak BSCF languages are strictly included in the family of strong BSCF languages for both the prefix- and equality-synchronized derivation mode. We can effectively decide whether the language generated by a weak BSCF grammar is empty.

Keywords: Derivation Tree; Empty Word; Language Family; Synchronization Condition; Tree Automaton (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-3394-4_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461333944

DOI: 10.1007/978-1-4613-3394-4_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().