My Account Log in

1 option

New Trends in Formal Languages : Control, Cooperation, and Combinatorics / edited by Gheorghe Paun, Arto Salomaa.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Păun, Gheorghe, editor.
Salomaa, Arto, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1218.
Lecture Notes in Computer Science, 0302-9743 ; 1218
Language:
English
Subjects (All):
Programming languages (Electronic computers).
Logic, Symbolic and mathematical.
Artificial intelligence.
Programming Languages, Compilers, Interpreters.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Local Subjects:
Programming Languages, Compilers, Interpreters.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Physical Description:
1 online resource (X, 474 pages).
Edition:
First edition 1997.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
System Details:
text file PDF
Summary:
This book presents a collection of refereed papers on formal language theory arranged for the occasion of the 50th birthday of Jürgen Dassow, who has made a significant contribution to the areas of regulated rewriting and grammar systems. The volume comprises 33 revised full papers organized in sections on regulated rewriting, cooperating distributed grammar systems, parallel communicating grammar systems, splicing systems, infinite words, and algebraic approaches to languages.
Contents:
A grammatical approach to the LBA problem
Conditional context-free languages of finite index
On the number of nonterminals in matrix grammars with leftmost derivations
The accepting power of finite automata over groups
Controlled fuzzy parallel rewriting
On controlling rewriting by properties of strings and symbols
Accepting array grammars with control mechanisms
On restarting automata with rewriting
Deterministic cooperating distributed grammar systems
Grammar systems with counting derivation and dynamical priorities
Characterization of RE using CD grammar systems with two registers and RL rules
On cooperating distributed uniformly limited 0L systems
Teams in grammar systems: Sub-context-free cases
A note on the incomparability of the E0L family with certain families of languages generated by cooperating grammar systems
Colonies as models of reactive systems
Grammatical inference of colonies
A grammar characterization of logarithmic-space computation
On the computational complexity of context-free Parallel Communicating Grammar Systems
Parallel communicating grammar systems with communication by signals
PC grammar systems versus some non-context-free constructions from natural and artificial languages
Grammar systems for the description of certain natural language facts
Networks of parallel language processors
A reduced distributed splicing system for RE languages
On the generative capacity of splicing grammar systems
Array splicing systems
Two lower bounds on computational complexity of infinite words
On ?-power languages
Shuffle-like operations on ?-words
Generalized Lindenmayerian algebraic systems
The structure of the basic morphisms
On mix operation
On the complexity of iterated insertions
The decidability of the generalized confluence problem for context-free languages.
Other Format:
Printed edition:
ISBN:
978-3-540-68703-0
9783540687030
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account