On the Computational Complexity of Synchronized Context-Free Languages

摘要

We introduce counter synchronized contextfree grammars and investigate their generative power. It turns out that the family of counter synchronized contextfree languages is a proper superset of the family of contextfree languages and is strictly contained