# Parsing Unary Boolean Grammars Using Online Convolution

@inproceedings{Okhotin2010ParsingUB, title={Parsing Unary Boolean Grammars Using Online Convolution}, author={Alexander Okhotin and Christian Reitwie{\ss}ner}, booktitle={Advances and Applications of Automata on Words and Trees}, year={2010} }

Consider context-free grammars generating strings over a one-letter alphabet. For the membership problem for such grammars, stated as \Given a grammar G and a string a n , determine whether a n is generated by G", only a nave O(jGj n 2 )-time algorithm is known. This paper develops a new algorithm solving this problem, which is based upon fast multiplication of integers, works in time jGj n log 3 n 2 O(log n) , and is applicable to the more general conjunctive and Boolean grammars. The… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 21 REFERENCES

## Faster Integer Multiplication

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Conjunctive Grammars

VIEW 7 EXCERPTS

## Matrix Multiplication via Arithmetic Progressions

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## General Context-Free Recognition in Less than Cubic Time

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Fast On-Line Integer Multiplication

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Conjunctive Grammars Can Generate Non-regular Unary Languages

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Boolean grammars

VIEW 4 EXCERPTS

## STRING-MATCHING AND OTHER PRODUCTS

VIEW 2 EXCERPTS

HIGHLY INFLUENTIAL