Search Results

Programmed grammars and their relation to the LBA problem

Authors: Bordihn, Henning; Holzer, Markus

Source: Acta Informatica, Volume 43, Number 4, November 2006 , pp. 223-242(20)

Publisher: Springer

Translation of binary regular expressions into nondeterministic &unknown;-free automata with O(nlogn) transitions

Author: Geffert V.

Source: Journal of Computer and System Sciences, Volume 66, Number 3, May 2003 , pp. 451-472(22)

Publisher: Elsevier

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

Authors: Fernau H.; Meduna A.

Source: Information Processing Letters, Volume 86, Number 5, 15 June 2003 , pp. 235-240(6)

Publisher: Elsevier

PC grammar systems with five context-free components generate all recursively enumerable languages

Authors: Csuhaj-Varju E.; Paun G.; Vaszil G.

Source: Theoretical Computer Science, Volume 299, Number 1, 18 April 2003 , pp. 785-794(10)

Publisher: Elsevier

Nonterminal complexity of programmed grammars

Author: Fernau H.

Source: Theoretical Computer Science, Volume 296, Number 2, 8 March 2003 , pp. 225-251(27)

Publisher: Elsevier

On the degree of scattered context-sensitivity

Authors: Fernau H.; Meduna A.

Source: Theoretical Computer Science, Volume 290, Number 3, 3 January 2003 , pp. 2121-2124(4)

Publisher: Elsevier

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds

Authors: Pighizzini G.; Shallit J.; Wang M-w.

Source: Journal of Computer and System Sciences, Volume 65, Number 2, September 2002 , pp. 393-414(22)

Publisher: Academic Press

Operations and language generating devices suggested by the genome evolution

Authors: Dassow J.; Mitrana¹ V.; Salomaa A.

Source: Theoretical Computer Science, Volume 270, Number 1, 6 January 2002 , pp. 701-738(38)

Publisher: Elsevier

Tight Lower Bounds on the Size of Sweeping Automata

Author: Leung H.

Source: Journal of Computer and System Sciences, Volume 63, Number 3, November 2001 , pp. 384-393(10)

Publisher: Academic Press

Beyond the Turing Test

Author: Hernandez-Orallo J.

Source: Journal of Logic, Language and Information, Volume 9, Number 4, October 2000 , pp. 447-466(20)

Publisher: Springer

Associative definition of programming languages

Authors: Crespi Reghizzi¹ S.; Pradella M.; San Pietro P.

Source: Computer Languages, Volume 26, Number 2, July 2000 , pp. 105-123(19)

Publisher: Elsevier

Generative power of three-nonterminal scattered context grammars

Author: Meduna A.

Source: Theoretical Computer Science, Volume 246, Number 1, 6 September 2000 , pp. 279-284(6)

Publisher: Elsevier

On the size of parsers and LR(k)-grammars

Authors: Leung¹ H.; Wotschke D.

Source: Theoretical Computer Science, Volume 242, Number 1, 6 July 2000 , pp. 59-69(11)

Publisher: Elsevier

On strongly context-free languages

Authors: Ilie¹ L.; Paun² G.; Rozenberg G.; Salomaa A.

Source: Discrete Applied Mathematics, Volume 103, Number 1, 15 July 2000 , pp. 153-165(13)

Publisher: Elsevier

Patterns and Languages: An Overview

Author: Mitrana V.

Source: Grammars, Volume 2, Number 2, 1999 , pp. 149-173(25)

Publisher: Springer

Independent parallelism in finite copying parallel rewriting systems

Authors: Rambow O.; Satta G.

Source: Theoretical Computer Science, Volume 223, Number 1, 28 July 1999 , pp. 87-120(34)

Publisher: Elsevier

Tree-Definable Linear Orders

Author: Lautemann C.

Source: Order, Volume 15, Number 2, 1998 , pp. 119-128(10)

Publisher: Springer

Automaticity II: Descriptional complexity in the unary case

Authors: Pomerance C.; Robson J.M.; Shallit J.

Source: Theoretical Computer Science, Volume 180, Number 1, 10 June 1997 , pp. 181-201(21)

Publisher: Elsevier

Cooperation in context-free grammars

Authors: Dassow J.; Mitrana V.

Source: Theoretical Computer Science, Volume 180, Number 1, 10 June 1997 , pp. 353-361(9)

Publisher: Elsevier

Automaticity I: Properties of a Measure of Descriptional Complexity

Authors: Shallit J.; Breitbart Y.

Source: Journal of Computer and System Sciences, Volume 53, Number 1, August 1996 , pp. 10-25(16)

Publisher: Elsevier