New Trends in Formal Languages: Control, Cooperation, and Combinatorics (Lecture Notes in Computer Science, 1218, Band 1218) - edizione con copertina flessibile

EAN (ISBN-13): 9783540628446
ISBN (ISBN-10): 3540628444
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 1997
Editore: Springer
484 Pagine
Peso: 0,725 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-05-27T20:32:18+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2023-05-17T08:30:54+02:00 (Zurich)
ISBN/EAN: 3540628444

ISBN - Stili di scrittura alternativi:
3-540-62844-4, 978-3-540-62844-6
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : salomaa arto, gheorghe, goos, pauñ
Titolo del libro: formal languages, combinatorics first course

---

Dati dell'editore

Autore: Gheorghe Paun; Arto Salomaa
Titolo: Lecture Notes in Computer Science; New Trends in Formal Languages - Control, Cooperation, and Combinatorics
Editore: Springer; Springer Berlin
474 Pagine
Anno di pubblicazione: 1997-04-09
Berlin; Heidelberg; DE
Lingua: Inglese
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 474 p.

BC; Hardcover, Softcover / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Formale Sprache; Fuzzy; Grammatik-Systeme; Natural; Regulierte Ersetzung; Verteilte Grammatiken; automata; communication; complexity; distributed grammars; formal language; formal languages; grammar systems; regulated rewriting; Compilers and Interpreters; Formal Languages and Automata Theory; Artificial Intelligence; Theoretische Informatik; Künstliche Intelligenz; EA

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.- Thedecidability of the generalized confluence problem for context-free languages.