Detail projektu

Optimally Integrated Models of Modern Information Technologies

Období řešení: 1. 1. 2004 - 31. 12. 2006

Typ projektu: grant

Kód: GA201/04/0441

Agentura: Grantová agentura České republiky

Program:

Název česky
Optimally Integrated Models of Modern Information Technologies
Typ
grant
Abstrakt

Projekt integruje různé výpočetní modely do systémů, které umožňují optimálně popisovat a studovat informační systémy. Zejména se soustřeďuje na distribuci, paralelizaci a kooperaci při výpočtu. Pro tuto činnost integruje zejména modely z teorie formálních jazyků a automatů.

Řešitelé
Meduna Alexander, prof. RNDr., CSc. (UIFS FIT VUT) , hlavní řešitel
Kolář Dušan, doc. Dr. Ing. (UIFS FIT VUT) , spoluřešitel
Publikace

2010

  • GOLDEFUS Filip. On Relations on Productions for Cooperative Distributed Grammar Systems. In: Proceedings of the 16th Conference Student EEICT 2010. Volume 5. Brno: Vysoké učení technické v Brně, 2010, s. 156-160. ISBN 978-80-214-4080-7. Detail

2007

  • BIDLO Radek, BLATNÝ Petr a MEDUNA Alexander. Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. Kybernetika, roč. 2007, č. 1, s. 21-35. ISSN 0023-5954. Detail

2006

  • TECHET Jiří. Bidirectional Contextual Grammars. In: Proceedings of 1st International Workshop WFM '06. Přerov: MARQ, 2006, s. 61-68. ISBN 80-86840-20-4. Detail
  • MEDUNA Alexander. Deep Pushdown Automata. Acta Informatica, roč. 2006, č. 98, s. 114-124. ISSN 0001-5903. Detail
  • KŘIVKA Zbyněk a MEDUNA Alexander. General Top-Down Parsers Based On Deep Pushdown Expansions. In: Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: MARQ, 2006, s. 11-18. ISBN 80-86840-20-4. Detail
  • KŘIVKA Zbyněk, MEDUNA Alexander a SCHÖNECKER Rudolf. Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, roč. 17, č. 5, 2006, s. 1223-1229. ISSN 0129-0541. Detail
  • KŘIVKA Zbyněk, MEDUNA Alexander a SCHÖNECKER Rudolf. Reducing Deep Pushdown Automata and Infinite Hierarchy. In: MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Mikulov: Fakulta informačních technologií VUT v Brně, 2006, s. 214-221. ISBN 80-214-3287-X. Detail

2005

  • LORENC Luboš a MEDUNA Alexander. A Rigorous Approach to Self-Reproducing Pushdown Translation. In: Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: MARQ, 2005, s. 51-58. ISBN 80-86840-09-3. Detail
  • MEDUNA Alexander. Automata and Languages: Theory and Applications [Springer, 2000]. London: Springer Verlag, 2005. ISBN 1-85233-074-0. Detail
  • VÍTEK Martin. Closure Properties of Insertion and Deletion Operations. In: Proceedings of the 11th conference Student EEICT 2005. Brno: Fakulta informačních technologií VUT v Brně, 2005, s. 586-590. ISBN 80-214-2890-2. Detail
  • BIDLO Radek. Context-Free Grammars over Free Groups. In: Proceedings of 8th International Conference ISIM'05 Information System Implementation and Modeling. Ostrava: MARQ, 2005, s. 95-100. ISBN 80-86840-09-3. Detail
  • BLATNÝ Petr. E0L Grammars on Free Groups. In: Proceedings of 8th International Conference ISIM'05 Information System Implementation and Modeling. Ostrava: MARQ, 2005, s. 81-86. ISBN 80-86840-09-3. Detail
  • BIDLO Radek, BLATNÝ Petr a MEDUNA Alexander. Formal Models over Free Groups. In: PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Fakulta informatiky MU, 2005, s. 193-199. Detail
  • MEDUNA Alexander a TECHET Jiří. Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybernetica, roč. 17, č. 1, 2005, s. 11-20. ISSN 0324-721X. Detail
  • MEDUNA Alexander a ŠVEC Martin. Grammars with Context Conditions and Their Applications [Wiley, 2004]. Wiley, New York: WILEY, 2005. ISBN 0-471-71831-9. Detail
  • VÍTEK Martin. Insertion and Deletion Operations in Formal Language Theory. In: Proceedings of 8th Spring International Conference ISIM '05. Ostrava: MARQ, 2005, s. 73-80. ISBN 80-86840-09-3. Detail
  • KOLÁŘ Dušan. Pushdown Automata: Another Extensions and Transformations. Brno: Fakulta informačních technologií VUT v Brně, 2005. Detail
  • KŘIVKA Zbyněk a MEDUNA Alexander. Random Context and Programmed Grammars of Finite Index Have The Same Generative Power. In: Proceedings of 8th International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: MARQ, 2005, s. 67-72. ISBN 80-86840-09-3. Detail
  • KŘIVKA Zbyněk. Recursive Erasing in Programmed Grammars. In: PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Znojmo: Fakulta informatiky MU, 2005, s. 139-144. Detail
  • KOLÁŘ Dušan a MEDUNA Alexander. Regulated Automata: From Theory towards Applications. In: Proceeding of 8th International Conference on Information Systems Implementation and Modelling ISIM'05. 1st edition. Ostrava: MARQ, 2005, s. 33-48. ISBN 80-86840-09-3. Detail
  • TECHET Jiří. Scattered Context Generators of Sentences with Their Parses. In: PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Znojmo: Fakulta informatiky MU, 2005, s. 68-77. Detail
  • LORENC Luboš a MEDUNA Alexander. Self-Reproducing Pushdown Transducers. Kybernetika, roč. 2005, č. 4, s. 533-539. ISSN 0023-5954. Detail
  • LORENC Luboš. Self-Reproducing Pushdown Translation. In: Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Nakladatelství Vysokého učení technického v Brně VUTIUM, 2005, s. 561-565. ISBN 80-214-2890-2. Detail
  • KŘIVKA Zbyněk. String-partitioning Systems. In: Proceedings of International Interdisciplinary HONEYWELL EMI 2005. Brno: Fakulta elektrotechniky a komunikačních technologií VUT v Brně, 2005, s. 217-221. ISBN 80-214-2942-9. Detail
  • KALÁB Petr. Two-Way Linear PC Grammar Systems. In: Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: MARQ, 2005, s. 87-94. ISBN 80-86840-09-3. Detail
  • KALÁB Petr. Two-Way Linear PC Grammar Systems and Their Descriptional Complexity. In: Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Nakladatelství Vysokého učení technického v Brně VUTIUM, 2005, s. 546-550. ISBN 80-214-2890-2. Detail

2004

  • KALÁB Petr. A Two-Way PC Grammar Systems Based on Regular Grammars. In: Proceedings of 10th Conference and Competition STUDENT EEICT 2004. Volume 2. Brno: Fakulta informačních technologií VUT v Brně, 2004, s. 252-256. ISBN 80-214-2635-7. Detail
  • MEDUNA Alexander a ŠKRKAL Oto. Combined Leftmost Derivations in Matrix Grammars. In: Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: MARQ, 2004, s. 127-132. ISBN 80-85988-99-2. Detail
  • ŠVEC Martin. Computational Simulation Formalized by String-Relation Systems. In: Proceedings of the 7th International Conference on Information Systems Implementation and Modelling (ISIM '04). MARQ. Ostrava: MARQ, 2004, s. 147-153. ISBN 80-85988-99-2. Detail
  • ŠVEC Martin. Computational Simulation Formalized by String-Relation Systems. In: Proceedings of the International Conference and Competition of Student's Scientific Works STUDENT EEICT 2004. STU. Bratislava: Slovenská technická univerzita v Bratislavě, 2004, s. 544-547. ISBN 80-227-2057-7. Detail
  • MEDUNA Alexander a VÍTEK Martin. New language operations in formal language theory. Schedae Informaticae, roč. 2004, č. 13, s. 123-150. ISSN 0860-0295. Detail
  • LORENC Luboš a MEDUNA Alexander. Self-Reproducing Pushdown Transducers. In: Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: MARQ, 2004, s. 155-160. ISBN 80-85988-99-2. Detail
  • KOPEČEK Tomáš a MEDUNA Alexander. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, roč. 2004, č. 23, s. 287-302. ISSN 1335-9150. Detail
  • KOLÁŘ Dušan. Simulation of LLk Parsers with Wide Context by Automaton with One-Symbol Reading Head. In: Proceedings of 38th International Conference MOSIS '04 - Modelling and Simulation of Systems. Ostrava: MARQ, 2004, s. 347-354. ISBN 80-85988-98-4. Detail
  • KALÁB Petr. Two-way PC Grammar Systems Based on Regular Grammars. In: Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modeling. 1st edition. Ostrava: MARQ, 2004, s. 111-118. ISBN 80-85988-99-2. Detail

2000

  • KOLÁŘ Dušan a MEDUNA Alexander. Descriptional complexity of multi-parallel grammars with respect to the number of nonterminals. Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back. London: neznámá, 2000, s. 212-225. ISBN 1-85233-074-0. Detail
  • MEDUNA Alexander. Generative Power of Three-Nonterminal Scattered Context Grammars. Theoretical Computer Science, roč. 2000, č. 246, s. 279-284. ISSN 0304-3975. Detail
  • MEDUNA Alexander. Terminating Left-Hand Sides of Scattered Context Grammars. Theoretical Computer Science, roč. 2000, č. 237, s. 424-427. ISSN 0304-3975. Detail
Nahoru