Developments in language theory II : at the crossroads of mathematics, computer science and biology : Magdeburg, Germany 17-21 July 1995
Author(s)
Bibliographic Information
Developments in language theory II : at the crossroads of mathematics, computer science and biology : Magdeburg, Germany 17-21 July 1995
World Scientific, c1996
Available at 13 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references
Description and Table of Contents
Description
The contributions of the proceedings cover almost all parts of the theory of formal languages from pure theoretical investigations to applications to programming languages. Main topics are combinatorial properties of words, sequences of words and sets of words, grammar systems and grammars with controlled derivations, generation of higher-dimensional objects and graphs, trace languages, numerical parameters of automata and languages.
Table of Contents
- Towards robustness in parsing - fuzzifying context-free language recognition
- the computational complexity of PCGS with regular components
- prefix and periodic languages of rational w-languages
- Cantor sets and Dejean's conjecture
- recent developments in trace theory
- trace language definable with modular quantifiers
- finite state recognizability for two-dimensional languages - a brief survey
- on emptiness and counting for alternating finite automata
- descriptional and computational complexity measure for distributive generation of languages
- nondeterminism degrees of context-free languages
- the membership problem for unordered vector languages
- transforming a single-valued transducer into a mealy machine.
by "Nielsen BookData"