Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail projektu
Období řešení: 01.01.2007 — 31.12.2009
Zdroje financování
Grantová agentura České republiky - Standardní projekty
- plně financující (2007-01-01 - 2009-12-31)
O projektu
This project discusses multi-information technologies. More specifically, it integrates various computational models into multi-systems that allow us to study and simulate modern information technologies in an optimal way. As its principle objective, this project intends to develop and study multi-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 modern information technologies, such as developmental biology.
Popis českyTento projekt diskutuje multiinformační technologie a jejich formalizaci.
Klíčová slovamulti-information technologies, formal models and languages, automata, grammars
Označení
GA201/07/0005
Originální jazyk
angličtina
Řešitelé
Meduna Alexandr, prof. RNDr., CSc. - hlavní řešitelKolář Dušan, doc. Dr. Ing. - spoluřešitelLukáš Roman, Ing., Ph.D. - spoluřešitel
Útvary
Fakulta informačních technologií- příjemce (01.01.2007 - 31.12.2009)
Výsledky
MEDUNA, A.; BIDLO, R.; BLATNÝ, P. Vertical Context in Phrase-Structure grammars. In Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov: Brno University of Technology, 2006. p. 17-23. ISBN: 80-214-3287-X.Detail
MEDUNA, A.; GOLDEFUS, F. Weak Leftmost Derivations in Cooperative Distributed Grammar Systems. MEMICS 09. Brno: Brno University of Technology, 2009. p. 144-151. ISBN: 978-80-87342-04-6.Detail
MEDUNA, A.; LUKÁŠ, R.; KRAJÍČEK, J. Homogeneous Multicontinuous Grammars and Their Reduction. In MEMICS 2007 Proceedings. Znojmo: Ing. Zdeněk Novotný, CSc., 2007. p. 90-96. ISBN: 978-80-7355-077-6.Detail
LUKÁŠ, R.; MEDUNA, A. General Multigenerative Grammar Systems. In Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravicí: Silesian University, 2007. p. 205-212. ISBN: 978-80-7248006-7.Detail
MASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. Automata and Formal Languages. The 12th International Conference, AFL 2008, Balatonfured, Hungary, May 27-30, 2008, Proceedings. Balatonfured: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2008. p. 325-336. ISBN: 978-963-311-367-7.Detail
MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Grammars Regulated by Context Conditions. In LATA 2007 Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili. Tarragona, Spain: 2007. p. 403-411.Detail
MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Generalized Forbidding Grammars. In Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras, Slovakia: University of Pavol Jozef Šafárik, 2007. p. 170-177. ISBN: 978-80-7097-688-3.Detail
MEDUNA, A.; TECHET, J. Maximal and Minimal Scattered Context Rewriting. In FCT 2007 Proceedings. Lecture Notes in Computer Science. Budapest: Springer Verlag, 2007. p. 412-423. ISSN: 0302-9743.Detail
MEDUNA, A.; TECHET, J. Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. In Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras: University of Pavol Jozef Šafárik, 2007. p. 178-185. ISBN: 978-80-7097-688-3.Detail
MEDUNA, A. New Trends in Algebraic Theory of Automata. ICDMA. Bangkok: University of South Australia, 2008. p. 211-222. ISBN: 0-7167-8261-8.Detail
HRUŠKA, T.; KOLÁŘ, D.; LUKÁŠ, R.; ZÁMEČNÍKOVÁ, E. Two-Way Coupled Finite Automaton and Its Usage in Translators. New Aspects of Circuits. WSEAS Applied Informatics & Communications. Heraklion: World Scientific and Engineering Academy, 2008. p. 445-449. ISBN: 978-960-6766-82-4. ISSN: 1790-5117.Detail
RYCHNOVSKÝ, L. Start String in Formal Language Theory. Proceedings of the 14th Conference STUDENT EEICT 2008. Brno: Faculty of Information Technology BUT, 2008. p. 422-426. ISBN: 978-80-214-3617-6.Detail
RYCHNOVSKÝ, L. Regulated Pushdown Automata Revisited. Proceedings of the 15th Conference STUDENT EEICT 2009. Brno: Faculty of Information Technology BUT, 2009. p. 440-444. ISBN: 978-80-214-3870-5.Detail
KOLÁŘ, D. Scattered Context Grammars Parsers. Proceedings of the 14th International Congress of Cybernetics and Systems of WOCS. Wroclaw: Wroclaw University of Technology, 2008. p. 491-500. ISBN: 978-83-7493-400-8.Detail
GOLDEFUS, F. Left-Forbidding Cooperating Distributed Grammar Systems. Proceedings of the 14th Conference and Competition STUDENT EEICT 2008 Volume 4. Brno: Faculty of Information Technology BUT, 2008. p. 403-407. ISBN: 978-80-214-3617-6.Detail
GOLDEFUS, F. Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components. Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. 4. Brno: Department of Information Systems FIT BUT, 2009. p. 400-4004. ISBN: 978-80-214-3870-5.Detail
MASOPUST, T. A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. In LATA 2009 proceedings. Lecture Notes in Computer Science. Lecture notes in computer science. Springer-Verlag Berlin Heidelberg: Springer Verlag, 2009. p. 554-565. ISBN: 978-3-642-00981-5. ISSN: 0302-9743.Detail
MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. Proceedings of 11th International Workshop on Descriptional Complexity of Formal Systems. Magdeburg: Otto-von-Guericke-University of Magdeburg, 2009. p. 235-245. ISBN: 978-3-940961-31-0.Detail
MEDUNA, A.; MASOPUST, T. Self-Regulating Finite Automata. Acta Cybernetica, 2007, vol. 18, no. 1, p. 135-153. ISSN: 0324-721X.Detail
MASOPUST, T.; MEDUNA, A. Descriptional complexity of semi-conditional grammars. Information Processing Letters, 2007, vol. 104, no. 1, p. 29-31. ISSN: 0020-0190.Detail
MEDUNA, A.; TECHET, J. Canonical Scattered Context Generators of Sentences with Their Parses. Theoretical Computer Science, 2007, vol. 2007, no. 389, p. 73-81. ISSN: 0304-3975.Detail
BIDLO, R.; BLATNÝ, P.; MEDUNA, A. Context-Free and E0L Derivations over Free Groups. Schedae Informaticae, 2007, vol. 2007, no. 16, p. 14-24. ISSN: 0860-0295.Detail
MEDUNA, A.; KOPEČEK, T.; ŠVEC, M. Similar Derivations of Equivalent Grammars. International Journal of Computer Mathematics, 2007, vol. 2007, no. 84, p. 1555-1566. ISSN: 0020-7160.Detail
MASOPUST, T.; MEDUNA, A.; ŠIMÁČEK, J. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, 2008, vol. 18, no. 4, p. 783-793. ISSN: 0324-721X.Detail
MEDUNA, A.; TECHET, J. An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. Theoretical Computer Science, 2009, vol. 410, no. 21, p. 1961-1969. ISSN: 0304-3975.Detail
MASOPUST, T.; MEDUNA, A. On context-free rewriting with a simple restriction and its computational completeness. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, vol. 43, no. 2, p. 365-378. ISSN: 0988-3754.Detail
MASOPUST, T.; MEDUNA, A. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, 2008, vol. 87, no. 3, p. 407-415. ISSN: 0169-2968.Detail
MEDUNA, A.; TECHET, J. Scattered Context Grammars that Erase Nonterminals in a Generalized k-Limited Way. Acta Informatica, 2008, vol. 45, no. 7, p. 593-608. ISSN: 0001-5903.Detail
MEDUNA, A.; RYCHNOVSKÝ, L. Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings. Philippine Computing Journal, 2008, roč. 2008, č. 3, s. 1-5. ISSN: 1908-1995.Detail
MASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, 2009, vol. 19, no. 2, p. 537-552. ISSN: 0324-721X.Detail
MASOPUST, T.; GOLDEFUS, F.; MEDUNA, A. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, 2010, vol. 411, no. 40, p. 3661-3667. ISSN: 0304-3975.Detail
MEDUNA, A. Elements of Compiler Design. Taylor and Francis. Taylor and Francis. New York: Taylor & Francis Informa plc, 2008. 304 p. ISBN: 978-1-4200-6323-3.Detail
KOPEČEK, T.; MEDUNA, A. Conditional Grammars and Their Reduction. Brno: Faculty of Information Technology BUT, 2008. 138 p. ISBN: 978-80-214-3750-0.Detail
MEDUNA, A.; TECHET, J. Scattered Context Grammars and their Applications. WIT Press, UK. WIT Press, UK. WIT Press, UK: WIT Press, 2010. 224 p. ISBN: 978-1-84564-426-0.Detail
MEDUNA, A. Conditional grammars are discussed. New Delhi: 2008. p. 214-226.Detail
KŘIVKA, Z.; MEDUNA, A. Generalized #-Rewriting Systems of Finite Index. In Information Systems and Formal Models (Proceedings of 2nd International Workshop on Formal Models (WFM'07)). Opava: Silesian University, 2007. p. 197-204. ISBN: 978-807248-006-7.Detail