Project Details

Optimally Integrated Models of Modern Information Technologies

Project Period: 1. 1. 2004 – 31. 12. 2006

Project Type: grant

Code: GA201/04/0441

Agency: Czech Science Foundation

Program: Standardní projekty

Czech title
Optimally Integrated Models of Modern Information Technologies
Type
grant
Keywords

formal models and systems, integration, cooperation

Abstract

This project integrates various computational models into systems that allow us to study and simulate modern information technologies in an optimal way. In particular, these systems are used to discuss computational cooperation, distribution, concurrence, and parallelism. Most of the systems under discussion will be based on an integration of formal models intensively studied in the theory of formal languages and computation, such as various sequential and parallel grammars and automata. As its principle objective, this project intends to develop and study systems that allow us to simulate and, thereby, examine modern information technologies in an elegant, general, natural, flexible, economical and realizable way. Making use of these advantages, this project will also examine the applications of the resulting systems in terms of several information technologies, including the technologies used in mathematical linguistics, business-oriented applications, and developmental biology. Most importantly, a detailed study of possible applications related to DNA computation will be investigated.

Team members
Meduna Alexandr, prof. RNDr., CSc. (DIFS) – research leader
Kolář Dušan, doc. Dr. Ing. (DIFS)
Publications

2010

  • GOLDEFUS, F. On Relations on Productions for Cooperative Distributed Grammar Systems. Proceedings of the 16th Conference Student EEICT 2010. Volume 5. Brno: Brno University of Technology, 2010. p. 156-160. ISBN: 978-80-214-4080-7. Detail

2007

  • BIDLO, R.; BLATNÝ, P.; MEDUNA, A. Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. Kybernetika, 2007, vol. 2007, no. 1, p. 21-35. ISSN: 0023-5954. Detail

2006

  • KŘIVKA, Z.; MEDUNA, A. General Top-Down Parsers Based On Deep Pushdown Expansions. Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: 2006. p. 11-18. ISBN: 80-86840-20-4. Detail
  • KŘIVKA, Z.; MEDUNA, A.; SCHÖNECKER, R. Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, 2006, vol. 17, no. 5, p. 1223-1229. ISSN: 0129-0541. Detail
  • MEDUNA, A. Deep Pushdown Automata. Acta Informatica, 2006, vol. 2006, no. 98, p. 114-124. ISSN: 0001-5903. Detail
  • SCHÖNECKER, R.; KŘIVKA, Z.; MEDUNA, A. Reducing Deep Pushdown Automata and Infinite Hierarchy. MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Mikulov: Faculty of Information Technology BUT, 2006. p. 214-221. ISBN: 80-214-3287-X. Detail
  • TECHET, J. Bidirectional Contextual Grammars. Proceedings of 1st International Workshop WFM '06. Přerov: 2006. p. 61-68. ISBN: 80-86840-20-4. Detail

2005

  • BIDLO, R. Context-Free Grammars over Free Groups. Proceedings of 8th International Conference ISIM'05 Information System Implementation and Modeling. Ostrava: 2005. p. 95-100. ISBN: 80-86840-09-3. Detail
  • BLATNÝ, P. E0L Grammars on Free Groups. Proceedings of 8th International Conference ISIM'05 Information System Implementation and Modeling. Ostrava: 2005. p. 81-86. ISBN: 80-86840-09-3. Detail
  • KALÁB, P. Two-Way Linear PC Grammar Systems and Their Descriptional Complexity. Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Publishing house of Brno University of Technology VUTIUM, 2005. p. 546-550. ISBN: 80-214-2890-2. Detail
  • KALÁB, P. Two-Way Linear PC Grammar Systems. Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2005. p. 87-94. ISBN: 80-86840-09-3. Detail
  • KOLÁŘ, D. Pushdown Automata: Another Extensions and Transformations. Brno: Faculty of Information Technology BUT, 2005. p. 0-0. Detail
  • KOLÁŘ, D.; MEDUNA, A. Regulated Automata: From Theory towards Applications. Proceeding of 8th International Conference on Information Systems Implementation and Modelling ISIM'05. 1st edition. Ostrava: 2005. p. 33-48. ISBN: 80-86840-09-3. Detail
  • KŘIVKA, Z. String-partitioning Systems. Proceedings of International Interdisciplinary HONEYWELL EMI 2005. Brno: Faculty of Electrical Engineering and Communication BUT, 2005. p. 217-221. ISBN: 80-214-2942-9. Detail
  • KŘIVKA, Z.; MEDUNA, A. Random Context and Programmed Grammars of Finite Index Have The Same Generative Power. Proceedings of 8th International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2005. p. 67-72. ISBN: 80-86840-09-3. Detail
  • LORENC, L. Self-Reproducing Pushdown Translation. Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Publishing house of Brno University of Technology VUTIUM, 2005. p. 561-565. ISBN: 80-214-2890-2. Detail
  • LORENC, L.; MEDUNA, A. A Rigorous Approach to Self-Reproducing Pushdown Translation. Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2005. p. 51-58. ISBN: 80-86840-09-3. Detail
  • LORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. Kybernetika, 2005, vol. 2005, no. 4, p. 533-539. ISSN: 0023-5954. Detail
  • MEDUNA, A.; ŠVEC, M. Grammars with Context Conditions and Their Applications. Wiley, New York: WILEY, 2005. 225 p. ISBN: 0-471-71831-9. Detail
  • MEDUNA, A.; TECHET, J. Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybernetica, 2005, vol. 17, no. 1, p. 11-20. ISSN: 0324-721X. Detail
  • VÍTEK, M. Closure properties of insertion and deletion operations. Proceedings of the 11th conference Student EEICT 2005. Brno: Faculty of Information Technology BUT, 2005. p. 586-590. ISBN: 80-214-2890-2. Detail
  • VÍTEK, M. Insertion and Deletion Operations in Formal Language Theory. Proceedings of 8th Spring International Conference ISIM '05. Ostrava: 2005. p. 73-80. ISBN: 80-86840-09-3. Detail

2004

  • KALÁB, P. A Two-Way PC Grammar Systems Based on Regular Grammars. Proceedings of 10th Conference and Competition STUDENT EEICT 2004. Volume 2. Brno: Faculty of Information Technology BUT, 2004. p. 252-256. ISBN: 80-214-2635-7. Detail
  • KALÁB, P. Two-way PC Grammar Systems Based on Regular Grammars. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modeling. 1st edition. Ostrava: 2004. p. 111-118. ISBN: 80-85988-99-2. Detail
  • KOLÁŘ, D. Simulation of LLk Parsers with Wide Context by Automaton with One-Symbol Reading Head. Proceedings of 38th International Conference MOSIS '04 - Modelling and Simulation of Systems. Ostrava: 2004. p. 347-354. ISBN: 80-85988-98-4. Detail
  • KOPEČEK, T.; MEDUNA, A. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, 2004, vol. 2004, no. 23, p. 287-302. ISSN: 1335-9150. Detail
  • LORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2004. p. 155-160. ISBN: 80-85988-99-2. Detail
  • MEDUNA, A.; ŠKRKAL, O. Combined Leftmost Derivations in Matrix Grammars. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2004. p. 127-132. ISBN: 80-85988-99-2. Detail
  • MEDUNA, A.; VÍTEK, M. New language operations in formal language theory. Schedae Informaticae, 2004, vol. 2004, no. 13, p. 123-150. ISSN: 0860-0295. Detail
  • ŠVEC, M. Computational Simulation Formalized by String-Relation Systems. Proceedings of the 7th International Conference on Information Systems Implementation and Modelling (ISIM '04). MARQ. Ostrava: 2004. p. 147-153. ISBN: 80-85988-99-2. Detail
  • ŠVEC, M. Computational Simulation Formalized by String-Relation Systems. Proceedings of the International Conference and Competition of Student's Scientific Works STUDENT EEICT 2004. STU. Bratislava: Slovak University of Technology in Bratislava, 2004. p. 544-547. ISBN: 80-227-2057-7. Detail

2000

  • KOLÁŘ, D.; MEDUNA, A. Descriptional complexity of multi-parallel grammars with respect to the number of nonterminals. In Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back. London: unknown, 2000. p. 212-225. ISBN: 1-85233-074-0. Detail
  • MEDUNA, A. Generative Power of Three-Nonterminal Scattered Context Grammars. Theoretical Computer Science, 2000, vol. 2000, no. 246, p. 279-284. ISSN: 0304-3975. Detail
  • MEDUNA, A. Terminating Left-Hand Sides of Scattered Context Grammars. Theoretical Computer Science, 2000, vol. 2000, no. 237, p. 424-427. ISSN: 0304-3975. Detail
Back to top