Array P systems and pure 2D context-free grammars with independent mode of rewriting

Journal of Membrane Computing ◽

10.1007/s41965-021-00090-2 ◽

2021 ◽

Author(s):

Somnath Bera ◽

Rodica Ceterchi ◽

Sastha Sriram ◽

K. G. Subramanian

Keyword(s):

P Systems ◽

Context Free ◽

Independent Mode ◽

Context Free Grammars

Download Full-text

Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search

Transactions of the Japanese Society for Artificial Intelligence ◽

10.1527/tjsai.21.371 ◽

2006 ◽

Vol 21 ◽

pp. 371-379 ◽

Author(s):

Katsuhiko Nakamura ◽

Akemi Hoshina

Keyword(s):

Incremental Learning ◽

Rule Generation ◽

Rule Set ◽

Context Free ◽

Context Free Grammars

Download Full-text

Block-based syntax from context-free grammars

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering ◽

10.1145/3426425.3426948 ◽

2020 ◽

Author(s):

Mauricio Verano Merino ◽

Tijs van der Storm

Keyword(s):

Block Based ◽

Context Free ◽

Context Free Grammars

Download Full-text

Improved Probabilistic Context-Free Grammars for Passwords Using Word Extraction

ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) ◽

10.1109/icassp39728.2021.9414886 ◽

2021 ◽

Author(s):

Haibo Cheng ◽

Wenting Li ◽

Ping Wang ◽

Kaitai Liang

Keyword(s):

Context Free ◽

Probabilistic Context ◽

Context Free Grammars ◽

Probabilistic Context Free Grammars

Download Full-text

The pre-NTS property is undecidable for context-free grammars

Information Processing Letters ◽

10.1016/0020-0190(92)90082-7 ◽

1992 ◽

Vol 44 (4) ◽

pp. 181-184 ◽

Author(s):

Louxin Zhang

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

Lower bounds for context-free grammars

Information Processing Letters ◽

10.1016/j.ipl.2011.06.006 ◽

2011 ◽

Vol 111 (18) ◽

pp. 895-898 ◽

Author(s):

Yuval Filmus

Keyword(s):

Lower Bounds ◽

Context Free ◽

Context Free Grammars

Download Full-text

Ambiguity in context-free grammars

Proceedings of the 1995 ACM symposium on Applied computing - SAC '95 ◽

10.1145/315891.315991 ◽

1995 ◽

Author(s):

Bruce S. N. Cheung

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars

Mathematical Logic Quarterly ◽

10.1002/malq.19880340106 ◽

1988 ◽

Vol 34 (1) ◽

pp. 41-52 ◽

Author(s):

Maciej Kandulski

Keyword(s):

Categorial Grammars ◽

Context Free ◽

Context Free Grammars

Download Full-text

A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages

Lecture Notes in Computer Science - Combinatorial Image Analysis ◽

10.1007/978-3-319-07148-0_12 ◽

2014 ◽

pp. 123-133 ◽

Author(s):

Zbyněk Křivka ◽

Carlos Martín-Vide ◽

Alexander Meduna ◽

K. G. Subramanian

Keyword(s):

Two Dimensional ◽

Picture Languages ◽

Context Free ◽

Context Free Grammars

Download Full-text

Context-Free Grammars

System Architecture ◽

10.1007/978-3-319-43065-2_10 ◽

2016 ◽

pp. 159-178

Author(s):

Wolfgang J. Paul ◽

Christoph Baumann ◽

Petro Lutsyk ◽

Sabine Schmaltz

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

Comparison between the Inside-Outside algorithm and the Viterbi algorithm for stochastic context-free grammars

Advances in Structural and Syntactical Pattern Recognition - Lecture Notes in Computer Science ◽

10.1007/3-540-61577-6_6 ◽

1996 ◽

pp. 50-59 ◽

Author(s):

Joan-Andreu Sánchez ◽

José-Miguel Benedí ◽

Francisco Casacuberta

Keyword(s):

Viterbi Algorithm ◽

Stochastic Context Free Grammars ◽

Context Free ◽

Context Free Grammars

Download Full-text