Abstract
AbstractA straight line program (SLP) is a circuit with letters as inputs and gates performing one of the operations union, concatenation, or star; its size is the number of its nodes. Every SLP describes a regular language in a natural manner. We study the complexity of language operations on SLPs and show that the complexity is exponential for intersection and shuffle, and double exponential for complementation. These results carry over to constant height pushdown automata and non-self-embedding grammars, since these models and SLPs are polynomially equivalent. We also examine extended SLPs that may perform additional operations and show that the cost of simulating an extended SLP with shuffle or intersection by a conventional SLP is double exponential. KeywordsRegular languageStraight line programLower boundOperational complexityShuffleConstant height pushdown automaton
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
