Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 36, 1990 - Issue 1-2
Submit an article Journal homepage
19
Views
21
CrossRef citations to date
0
Altmetric
Original Articles

Generalized forbidding grammars

Alexander Meduna Computer Science Department, University of Missouri-Columbia, Columbia, Missouri, 65211, USA
Pages 31-38 | Received 16 Jan 1990, Published online: 19 Mar 2007

Citations (21)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (7)

Alexander Meduna & Petr Zemek. (2013) Generalized one-sided forbidding grammars. International Journal of Computer Mathematics 90:2, pages 172-182.
Read now
Alexander Meduna & Petr Zemek. (2012) One-sided forbidding grammars and selective substitution grammars. International Journal of Computer Mathematics 89:5, pages 586-596.
Read now
Alexander Meduna & Martin Švec. (2003) Descriptional Complexity Of Generalized Forbidding Grammars. International Journal of Computer Mathematics 80:1, pages 11-17.
Read now
Alexander Meduna. (1999) Middle quotients of linear languages. International Journal of Computer Mathematics 71:3, pages 319-335.
Read now
Alexander Meduna. (1999) Prefix pushdown automata and their simplification. International Journal of Computer Mathematics 71:1, pages 1-20.
Read now
Alexander Meduna. (1993) A formalization of sequential, parallel, and continuous rewriting. International Journal of Computer Mathematics 47:3-4, pages 153-161.
Read now
Erzsébet Csuhaj-Varjú. (1993) On grammars with local and global context conditions. International Journal of Computer Mathematics 47:1-2, pages 17-27.
Read now

Articles from other publishers (14)

Henning Fernau, Lakshmanan Kuppusamy & Indhumathi Raman. (2024) On the computational completeness of generalized forbidding matrix grammars. Theoretical Computer Science 999, pages 114539.
Crossref
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele & Indhumathi Raman. (2022) Improved descriptional complexity results on generalized forbidding grammars. Discrete Applied Mathematics 319, pages 2-18.
Crossref
Martin Vu & Henning Fernau. (2021) Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. Algorithms 14:5, pages 131.
Crossref
Henning Fernau, Lakshmanan Kuppusamy & Indhumathi Raman. 2021. Membrane Computing. Membrane Computing 31 45 .
Henning Fernau, Lakshmanan Kuppusamy & Indhumathi Raman. 2020. Descriptional Complexity of Formal Systems. Descriptional Complexity of Formal Systems 52 63 .
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele & Indhumathi Raman. 2019. Algorithms and Discrete Applied Mathematics. Algorithms and Discrete Applied Mathematics 174 188 .
Ajay Kumar, Nidhi Kalra & Sunita Garhwal. (2018) Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets. Sādhanā 43:8.
Crossref
Nidhi Kalra & Ajay Kumar. (2018) Deterministic Deep Pushdown Transducer and its Parallel Version. The Computer Journal 61:1, pages 63-73.
Crossref
Alexander Meduna & Ondřej SoukupAlexander Meduna & Ondřej Soukup. 2017. Modern Language Models and Computation. Modern Language Models and Computation 513 522 .
Nidhi Kalra & Ajay Kumar. (2016) Fuzzy state grammar and fuzzy deep pushdown automaton. Journal of Intelligent & Fuzzy Systems 31:1, pages 249-258.
Crossref
Sherzod Turaev, Mohd Izzuddin Mohd Tamrin & Norsaremah Salleh. 2014. Intelligent Information and Database Systems. Intelligent Information and Database Systems 53 62 .
Alexander Meduna & Petr ZemekAlexander Meduna & Petr Zemek. 2014. Regulated Grammars and Automata. Regulated Grammars and Automata 653 668 .
Alexander Meduna & Martin Švec. (2003) Forbidding ET0L grammars. Theoretical Computer Science 306:1-3, pages 449-469.
Crossref
Jürgen Dassow, Gheorghe Păun & Arto Salomaa. 1997. Handbook of Formal Languages. Handbook of Formal Languages 101 154 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.