This is an old revision of the document!
Authors: | Meduna, Alexander and Techet, Jiří |
Title: | Scattered Context Grammars and their Applications |
Publisher: | WIT Press, Ashurst Lodge, Southampton, SO40 7AA, UK |
ISBN: | 978-1-84564-426-0 |
Publication Date: | 2009 |
Details: | Hardcover, 212 pages |
This website is in preparation.
Alexander Meduna, Full Professor of Computer Science at the Brno University of Technology, received his PhD from this university in 1988. He has taught theoretical computer science at various European, Asian, and American universities, including the University of Missouri, where he spent a decade teaching advanced topics of the formal language theory. He is the author of the books entitled Automata and Languages (Springer, 2000) and Elements of Compiler Design (Taylor and Francis, 2008). Along with Martin Švec, his former PhD student, he is also the co-author of Grammars with Context Conditions and Their Applications (Wiley, 2005). He has published over seventy papers related to the subject of this book.
Jiří Techet received his PhD from the Brno University of Technology in 2008 under the supervision of Alexander Meduna. He has published several studies on scattered context grammars in such distinguished computer science journals as Acta Informatica and Theoretical Computer Science.
This advanced computer science book systematically and compactly summarizes the current knowledge about scattered context grammars—an important area of the formal language theory at present. Primarily, the book covers the theoretical properties of these grammars, such as generative power, closure properties, simplification, and reduction. Secondarily, it sketches their linguistically oriented applications. In its conclusion, the book formulates new investigation areas, sketches further applications, and gives a comprehensive biography related to the scattered context grammars.
This book is relevant to advanced students and specialists in theoretical computer science and related areas, such as computational linguistics or discrete mathematics.
* **by others:** * Greibach, S. & Hopcroft, J., Scattered context grammars. Journal of Computer and System Sciences, 3, pp. 233–247, 1969. * Virkkunen, V., On scattered context grammars. Acta Universitatis Ouluensis, 20(6), pp. 75–82, 1973. * Cremers, A.B., Normal forms for context-sensitive grammars. Acta Informatica, 3, pp. 59–73, 1973. * Masopust, T., Scattered context grammars can generate the powers of 2. EEICT 2007 Proceedings, Brno, pp. 401–404, 2007. * Milgram, D. & Rosenfeld, A., A note on scattered context grammars. Information Processing Letters, 1, pp. 47–50, 1971. * Paun, G., On simple matrix languages versus scattered context languages. Informatique Théorique et Applications, 16(3), pp. 245–253, 1982. * Masopust, T. & Techet, J., Leftmost derivations of propagating scattered context grammars: A new proof. Discrete Mathematics and Theoretical Computer Science, 10(2), pp. 39–46, 2008. * Mayer, O., Some restrictive devices for context-free grammars. Information and Control, 20, pp. 69–92, 1972. * Fernau, H., Scattered context grammars with regulation. Annals of Bucharest University, Mathematics-Informatics Series, 45(1), pp. 41–49, 1996. * Gonczarowski, J. & Warmuth, M.K., Scattered versus context-sensitive rewriting. Acta Informatica, 27, pp. 81–95, 1989. * Vaszil, G., On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theoretical Computer Science, 330, pp. 361–373, 2005. * Ehrenfeucht, A. & Rozenberg, G., An observation on scattered grammars. Information Processing Letters, 9(2), pp. 84–85, 1979. * Král, J., On multiple grammars. Kybernetika, 1, pp. 60–85, 1969. * Masopust, T., On the descriptional complexity of scattered context grammars. Theoretical Computer Science, 410(1), pp. 108–112, 2009. *
To buy the book, visit this website.