Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Linear grammars with one-sided contexts and their automaton representation

Mikhail Barash, Alexander Okhotin

RAIRO-Theor. Inf. Appl., 49 2 (2015) 153-178

Published online: 2015-07-08

DOI: https://doi.org/10.1051/ita/2015004

This article has been cited by the following article(s):

The hardest language for grammars with context operators

Mikhail Mrykhin and Alexander Okhotin
Theoretical Computer Science 958 113829 (2023)
https://doi.org/10.1016/j.tcs.2023.113829

Language and Automata Theory and Applications

Takayuki Miyazaki and Yasuhiko Minamide
Lecture Notes in Computer Science, Language and Automata Theory and Applications 12638 213 (2021)
https://doi.org/10.1007/978-3-030-68195-1_16

Linear-space recognition for grammars with contexts

Mikhail Barash and Alexander Okhotin
Theoretical Computer Science 719 73 (2018)
https://doi.org/10.1016/j.tcs.2017.11.006

Developments in Language Theory

Alexander Okhotin
Lecture Notes in Computer Science, Developments in Language Theory 11088 36 (2018)
https://doi.org/10.1007/978-3-319-98654-8_4

Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts

Mikhail Barash and Alexander Okhotin
Theory of Computing Systems 61 (2) 581 (2017)
https://doi.org/10.1007/s00224-016-9683-3

Input-driven languages are linear conjunctive

Alexander Okhotin
Theoretical Computer Science 618 52 (2016)
https://doi.org/10.1016/j.tcs.2016.01.007