Block-Synchronization Context-Free Grammars

Jürgensen, Helmut; Salomaa, Kai

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

Cited by 4 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the construction used to show that L e (SCF) = L p (SCF) in [4] it follows that an arbitrary e-synchronized grammar can be simulated by a p-synchronized grammar of (essentially) same synchronization depth, and vice versa. This property is stated below.…”

Section: Definitionmentioning

confidence: 96%

“…It was proven in [4] that p-and e-synchronization generate the same family of languages, i.e. L e (SCF) = L p (SCF) = L(SCF).…”

Section: Definitionmentioning

confidence: 97%

“…We define synchronized context-free grammars and languages as in [4]. Each node in a derivation tree of an SCF grammar has a situation sequence associated with it.…”

Section: Synchronized Context-free Grammarsmentioning

confidence: 99%

“…In [4], Jürgensen and Salomaa introduced synchronized context-free (SCF) grammars as well as block-synchronized context-free (BSCF) grammars, in which independent paths in a context-free derivation can communicate in order to synchronize by means of situation symbols. Different aspects of SCF and BSCF grammars where studied in [4][5][6][7].…”

Section: Introductionmentioning

confidence: 99%

“…Different aspects of SCF and BSCF grammars where studied in [4][5][6][7]. The idea of synchronization as a method of communication was proposed in a similar way for automata in [8].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An infinite hierarchy induced by depth synchronization

Biegler

McQuillan

Salomaa

2007

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Depth-synchronization measures the number of parallel derivation steps in a synchronized context-free (SCF) grammar. When not bounded by a constant the depth-synchronization measure of an SCF grammar is at least logarithmic and at most linear with respect to the word length. Languages with linear depth-synchronization measure and languages with a depth-synchronization measure in between logarithmic and linear are proven to exist. This gives rise to a strict infinite hierarchy within the family of SCF (and ET0L) languages. Crown

show abstract

Section: Definitionmentioning

confidence: 96%

“…It was proven in [4] that p-and e-synchronization generate the same family of languages, i.e. L e (SCF) = L p (SCF) = L(SCF).…”

Section: Definitionmentioning

confidence: 97%

“…We define synchronized context-free grammars and languages as in [4]. Each node in a derivation tree of an SCF grammar has a situation sequence associated with it.…”

Section: Synchronized Context-free Grammarsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Different aspects of SCF and BSCF grammars where studied in [4][5][6][7]. The idea of synchronization as a method of communication was proposed in a similar way for automata in [8].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations