LINGUIST List 11.1150

Sat May 20 2000

TOC: Grammars, Vol 2, Issue 3

Editor for this issue: Scott Fults <scottlinguistlist.org>


Directory

  1. kap-listman, Grammars. Vol. 2, Issue 3

Message 1: Grammars. Vol. 2, Issue 3

Date: Fri, 19 May 2000 02:18:54 +0200 (MEST)
From: kap-listman <kap-listmanwkap.nl>
Subject: Grammars. Vol. 2, Issue 3

Grammars

ISSN 1386-7393

http://www.wkap.nl/issuetoc.htm/1386-7393+2+3+1999

Vol. 2, Issue 3, December 1999.

TITLE: Preface
AUTHOR(S): 
KEYWORD(S): mathematical linguistics, order-sorted algebra, mildly
context-sensitive language.
PAGE(S): 177-177

TITLE: Cut-and-Paste Languages
AUTHOR(S): Rodica Ceterchi
KEYWORD(S): fix-point equations, cut-and-paste, contextual grammars.
PAGE(S): 179-188

TITLE: Generalized P-Systems with Splicing and Cutting/Recombination
AUTHOR(S): Rudolf Freund
KEYWORD(S): P-systems, molecular computing, splicing.
PAGE(S): 189-199

TITLE: Shuffle-Based Multilanguages
AUTHOR(S): Radu Gramatovici
KEYWORD(S): mathematical linguistics, order-sorted algebra, mildly
context-sensitive language.
PAGE(S): 201-210

TITLE: The Generative Power of Context-free Node Rewriting in
Hypergraphs
AUTHOR(S): Renate Klempien-Hinrichs
KEYWORD(S): graph grammar, node rewriting, hypergraph, context-freeness.
PAGE(S): 211-221

TITLE: On Special Forms of Restarting Automata*
AUTHOR(S): Frantisek Mraz, Martin Platek, Martin Prochazka
KEYWORD(S): monotonicity, restarting automaton, weak cyclic form.
PAGE(S): 223-233

TITLE: Conditional Tabled Eco-Grammar Systems: the Scattered Contexts
AUTHOR(S): Petr Sosik
KEYWORD(S): eco-grammar systems, context conditions, formal grammars.
PAGE(S): 235-245

TITLE: On the Power of Reading the Whole Infinite Input Tape
AUTHOR(S): Ludwig Staiger
KEYWORD(S): Turing machines, arithmetical hierarchy.
PAGE(S): 247-257

TITLE: On the Concatenation of One-Turn Pushdowns
AUTHOR(S): Christian Wartena
KEYWORD(S): regulated rewriting, storage structures, multi-pushdown
automata.
PAGE(S): 259-269

TITLE: On the Decidability of the Equivalence Problem for Orthogonal
Sequential Programs
AUTHOR(S): Vladimir A. Zakharov
KEYWORD(S): sequential program, equivalence problem, orthogonal substitution.
PAGE(S): 271-281

TITLE: Run-time Extensible Deterministic Top-Down Parsing*
AUTHOR(S): Michal Zemlicka, Jaroslav Kral
KEYWORD(S): kind grammar, top-down parsing, extensible languages.
PAGE(S): 283-293

- ------------------------------------------------------------


 
Thank you for your interest in Kluwer's books and journals. 
 
NORTH, CENTRAL AND SOUTH AMERICA 
Kluwer Academic Publishers 
Order Department, PO Box 358 
Accord Station, Hingham, MA 02018-0358 
USA 
Telephone (781) 871-6600 
Fax (781) 681-9045 
E-Mail: kluwerwkap.com 
 
Kluwer Law International 
Order Department 
675 Massachusetts Avenue 
Cambridge, MA 02139 
USA 
Telephone: (617) 354-0140 
Toll-free (US customers only): 800 577-8118 
Fax: (617) 354-8595 
E-mail: saleskluwerlaw.com 
 
 
EUROPE, ASIA AND AFRICA 
Kluwer Academic Publishers 
Distribution Center 
PO Box 322 
3300 AH Dordrecht 
The Netherlands 
Telephone 31-78-6392392 
Fax 31-78-6546474 
E-Mail: orderdeptwkap.nl 
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue