Linear conjunctive grammars are a family of formal grammars with an explicit conjunction operation allowed in the rules, which is notable for its computational equivalence fo one-way real-time cellular automata, also known as trellis automata. This paper investigates the LL($k$) subclass of linear conjunctive grammars, defined by analogy with the classical LL($k$) grammars: these are grammars that admit top-down linear-time parsing with $k$-symbol lookahead. Two results are presented. First, every LL($k$) linear conjunctive grammar can be transformed to an LL(1) linear conjunctive grammar, and, accordingly, the hierarchy with respect to $k$ collapses. Secondly, a parser for these grammars that works in linear time and uses logarithmic space is constructed, showing that the family of LL($k$) linear conjunctive languages is contained in the complexity class $L$.
Describing the syntax of programming languages using conjunctive and Boolean grammars
Floyd的一个经典结果（“On the non-existence of a phrase structure grammar for ALGOL 60”，1962）指出，任何合理的程序设计语言的完整语法都不能用普通的形式语法（乔姆斯基的"context-free“）来描述。本文使用的语法扩展与合取和否定运算符，被称为合取语法和布尔语法，描述了一个简单的无类型的过程程序设计语言的一组格式良好的程序。一个完整的布尔文法，它定义了这样的概念，作为声明的变量和函数之前，他们的使用，构造和解释。使用用于布尔文法的广义LR解析算法，然后可以在时间上解析程序的长度$O(n^4)$，而另一已知算法允许子时间解析。接下来，它是如何将这种语法转换为一个明确的合取语法，平方时间解析。这显然成为完全由计算上可行的形式文法对程序设计语言的语法的第一个规范。
Representing a P-complete problem by small trellis automata
电路值问题的被称为顺序NOR电路值问题的受限情况最近被用于获得表示P-完全语言的合取语法、布尔语法和语言方程的非常简洁的示例（Okhotin，http://dx.doi.org/10.1007/978-3-540-74593-8_23“A simple P-complete problem and its representations by language equations”，MCU 2007）。本文对这一问题提出了一种新的编码方法，并构造了一个具有11个状态的格状自动机（单向实时元胞自动机）来解决这一问题。
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies
Università di Firenze（佛罗伦萨大学）；University of Rochester（罗切斯特大学）；Università di Milano（米兰大学）；Università di Roma Tor Vergata（罗马第二大学（托尔·维尔加塔））；University of Padua（帕多瓦大学）
Construction of a DFA for Computing Grundy Numbers in the Successful Derivation Games on Right-Linear Grammars
School of Informatics, Kochi University of Technology（高知工科大学信息学部）；Graduate School of Informatics, Nagoya University（名古屋大学情报学府）；School of Social Informatics, Mukogawa Women’s University（武库川女子大学社会信息学部）
