http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
This book presents a collection of refereed papers on formal language theory arranged for the occasion of the 50th birthday of Jü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.
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.
Programming languages (Electronic computers)
Programming Languages, Compilers, Interpreters