Linear grammars with one-sided contexts and their automaton representation

Mikhail Barash, Alexander Okhotin

Research outputpeer-review

3 Citations (Scopus)

Abstract

The paper considers a family of formal grammars that extends linear context-free grammars with an operator for referring to the left context of a substring being defined, as well as with a conjunction operation (as in linear conjunctive grammars). These grammars are proved to be computationally equivalent to an extension of one-way real-time cellular automata with an extra data channel. The main result is the undecidability of the emptiness problem for grammars restricted to a one-symbol alphabet, which is proved by simulating a Turing machine by a cellular automaton with feedback. The same construction proves the σ02-completeness of the finiteness problem for these grammars.

Original languageEnglish
Title of host publicationLATIN 2014
Subtitle of host publicationTheoretical Informatics - 11th Latin American Symposium, Proceedings
PublisherSpringer Nature
Pages190-201
Number of pages12
ISBN (Print)9783642544224
DOIs
Publication statusPublished - 1 Jan 2014
Event11th Latin American Theoretical Informatics Symposium, LATIN 2014 - Montevideo
Duration: 31 Mar 20144 Apr 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Latin American Theoretical Informatics Symposium, LATIN 2014
CountryUruguay
CityMontevideo
Period31/03/144/04/14

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Linear grammars with one-sided contexts and their automaton representation'. Together they form a unique fingerprint.

Cite this