The following publications are possibly variants of this publication:
- Prefix Probabilities for Linear Context-Free Rewriting SystemsMark-Jan Nederhof, Giorgio Satta. iwpt 2011: 151-162 [doi]
- Recognition of Linear Context-Free Rewriting SystemsGiorgio Satta. acl 1992: 89-95
- Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting SystemsPierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta. acl 2011: 450-459 [doi]
- Efficient Parsing of Well-Nested Linear Context-Free Rewriting SystemsCarlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta. naacl 2009: 276-284 [doi]
- Optimal Reduction of Rule Length in Linear Context-Free Rewriting SystemsCarlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David J. Weir. naacl 2009: 539-547 [doi]
- An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out TwoCarlos Gómez-Rodríguez, Giorgio Satta. acl 2009: 985-993 [doi]
- Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out TwoBenoît Sagot, Giorgio Satta. acl 2010: 525-533 [doi]