The generative capacity of block-synchronized context-free grammars
暂无分享,去创建一个
[1] M. W. Shields. An Introduction to Automata Theory , 1988 .
[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[3] Oscar H. Ibarra,et al. The LD and DLAD Bio-Operations on Formal Languages , 2003, J. Autom. Lang. Comb..
[4] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[5] Kai Salomaa,et al. Block-Synchronization Context-Free Grammars , 1997, Advances in Algorithms, Languages, and Complexity.
[6] Ding-Zhu Du,et al. Advances in Algorithms, Languages, and Complexity , 1997 .
[7] Anna Slobodová,et al. Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines , 1994, Theor. Comput. Sci..
[8] Markus Holzer,et al. On the Computational Complexity of Synchronized Context-Free Languages , 2002, J. Univers. Comput. Sci..
[9] Alfred V. Aho. Indexed Grammars-An Extension of Context Free Grammars , 1967, SWAT.
[10] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[11] Jan van Leeuwen,et al. Stack Machines and Classes of Nonnested Macro Languages , 1980, JACM.
[12] Anna Slobodová,et al. On the power of synchronization in parallel computations , 1991, Discret. Appl. Math..
[13] Kai Salomaa,et al. Synchronized Tree Automata , 1994, Theor. Comput. Sci..
[14] Ian McQuillan. Descriptional Complexity of Block-Synchronization Context-Free Grammars , 2002, DCFS.
[15] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .