Pumping, shrinking and pronouns: From context free to indexed grammars

Eli Shamir*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Pumping-shrinking operation is a useful tool in the study of Formal Languages. A pump-shrink bound for Linear Indexed Grammars is derived, depending only on the the number of auxiliary symbols of the grammar. Observations are suggested on formal operations analogous to shrinking of subordinate clauses.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 7th International Conference, LATA 2013, Proceedings
PublisherSpringer Verlag
Pages516-522
Number of pages7
ISBN (Print)9783642370632
DOIs
StatePublished - 2013
Event7th International Conference on Language and Automata Theory and Applications, LATA 2013 - Bilbao, Spain
Duration: 2 Apr 20135 Apr 2013

Publication series

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

Conference

Conference7th International Conference on Language and Automata Theory and Applications, LATA 2013
Country/TerritorySpain
CityBilbao
Period2/04/135/04/13

Keywords

  • Formal Languages
  • Linear-Index Grammars
  • pumping shrinking lemmas

Fingerprint

Dive into the research topics of 'Pumping, shrinking and pronouns: From context free to indexed grammars'. Together they form a unique fingerprint.

Cite this