zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Handbook of formal languages. Vol. 1--3. (English) Zbl 0866.68057
Berlin: Springer. not consec. pag. DM 348,00; öS 2.540,40; sFr 303,00 (1997).
The three-volumes Handbook of Formal Languages represents a really outstanding enterprise, and constitutes both a necessary and unique collection of information resources for the (theoretical) computer science community. This Handbook presents the current state of the art in formal language theory, and within the theoretical areas related to its main sources (mathematics, mathematical logic, linguistics, artificial intelligence, molecular genetics etc.), as well as application and development directions (e.g. mathematical and/or computational linguistics, parsing technologies, information theory, developmental biology, computer graphics, concurrent and distributed systems, molecular biology, pattern matching, cryptology etc.). Volume 1 (Word, Language, Grammar) is mainly devoted to mathematical (grammatical, computational, and algebraic) aspects of the basic theory of formal languages. Risking to (apparently) be boring, it is however impossible not to mention (at least) the titles and the authors of the contained papers: they speak best for themselves and for those who want and know to listen. For Volume 1: Formal Languages: an Introduction and a Synopsis ({\it A. Mateescu}, {\it A. Salomaa}), Regular Languages ({\it S. Yu}), Context-Free Languages and Pushdown Automata ({\it J.-M. Autebert}, {\it J. Berstel}, {\it L. Boasson}), Aspects of Classical Language Theory ({\it A. Mateescu}, {\it A. Salomaa}), L Systems ({\it Lila Kari}, {\it G. Rozenberg}, {\it A. Salomaa}), Combinatorics on Words ({\it Ch. Choffrut}, {\it J. Karhumäki}), Morphisms ({\it T. Harju}, {\it J. Karhumäki}), Codes ({\it H. Jürgensen}, {\it S. Konstantinidis}), Semirings and Formal Power Series ({\it W. Kuich}), Syntactic Semirings ({\it J.-E. Pin}), Regularity and Finiteness Conditions ({\it A. de Luca}, {\it S. Varricchio}), Families Generated by Grammars and L Systems ({\it G. Păun}, {\it A. Salomaa}). Volume 2 (Linear Modeling: Background and Application) contains papers dealing with linear models of the word functioning, with a special emphasis on computational linguistics and complexity, molecular genetics, and cryptology: Complexity: A Lanquage-Theoretic Point of View ({\it C. Calude}, {\it J. Hromkovič}), Parsing of Context-Free Languages ({\it K. Sikkel}, {\it A. Nijholt}), Grammars with Controlled Derivations ({\it J. Dassow}, {\it G. Păun}, {\it A. Salomaa}), Grammar Systems ({\it J. Dassow}, {\it G. Păun}, {\it G. Rozenberg}), Contextual Grammars and Natural Languages ({\it S. Marcus}), Contextual Grammars: and Formal Languages ({\it A. Ehrenfeucht}, {\it G. Păun}, {\it G. Rosenberg}), Language Theory and molecular Genetics ({\it T. Head}, {\it G. Păun}, {\it D. Pixton}), String Editing and Longest Common Subsequences ({\it A. Apostolico}), Automata for Matching Patterns ({\it M. Crochemore}, {\it Ch. Hancart}), Symbolic Dynamics and Finite Automata ({\it M.-P. Béal}, {\it D. Perrin}), Cryptology: Language-Theoretic Aspects ({\it V. Niemi}). Finally, Volume 3 (Beyond Words) comprises non-linear models on words (trees, graphs etc.) and their applications (linguistics, mathematical logic, theory of programming, computer graphics etc.): Tree Languages ({\it F. Gécseg}, {\it M. Steinby}), Tree-Adjoining Grammars ({\it A. Joshi}, {\it Y. Schabes}), Context-Free Graph Grammars ({\it J. Engelfriet}), Two-Dimensional Languages ({\it Dora Giammarresi}, {\it A. Restivo}), Basics of Term Rewriting ({\it M. Jantzen}), $\omega$-Languages ({\it L. Staiger}), Languages, Automata, and Logic ({\it W. Thomas}), Partial Commutation and Traces ({\it V. Diekert}, {\it Y. Metivier}), Visual models of Plant Development ({\it P. Prusinkiewicz} et al.), Digital Images and Formal Languages ({\it K. Culik II}, {\it J. Kari}). A final remark on the Handbook: the contributions show the current prominence of some national mathematical and computer science schools into the formal language theory field: namely, the tradition and value of the American, Finlander, French, Romanian, Canadian, Polish, Hollandish, German, and Italian schools.

68Q45Formal languages and automata
68-00Reference works (computer science)
68-XXComputer science
68P25Data encryption