Priti Shankar

Available identifiers

Publication	Date of Publication	Type
Syntax Directed Compression of Trees Using Pushdown Automata	2013-02-26	Paper
Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes	2008-12-21	Paper
Implementation and Application of Automata	2006-11-13	Paper
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code	2004-07-12	Paper
On viewing block codes as finite automata.	2003-08-17	Paper
Partial redundancy elimination: A simple, pragmatic, and provably correct algorithm.	2003-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4544432	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4501521	2000-11-22	Paper
A new algorithm for linear regular tree pattern matching	2000-08-21	Paper
Linear time parsers for classes of non context free languages	1997-02-27	Paper
A note on the reconstruction of a binary tree from its traversals	1993-01-16	Paper
A graph-based regularity test for deterministic context-free languages	1992-06-26	Paper
A compiler writing system based on affix grammars	1988-01-01	Paper
Parallel parsing of programming languages	1987-01-01	Paper
A new parallel algorithm for parsing arithmetic infix expressions	1987-01-01	Paper
On BCH codes over arbitrary integer tings (Corresp.)	1979-01-01	Paper

This page was built for person: Priti Shankar