Přístupnostní navigace
E-application
Search Search Close
Project detail
Duration: 1.1.2007 — 31.12.2009
Funding resources
Grantová agentura České republiky - Standardní projekty
- whole funder (1. 1. 2007 - 31. 12. 2009)
On the project
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.
Description in CzechTento projekt diskutuje multiinformační technologie a jejich formalizaci.
Keywords multi-information technologies, formal models and languages, automata, grammars
Mark
GA201/07/0005
Default language
English
People responsible
Meduna Alexandr, prof. RNDr., CSc. - principal person responsibleKolář Dušan, doc. Dr. Ing. - fellow researcherLukáš Roman, Ing., Ph.D. - fellow researcher
Units
Faculty of Information Technology- responsible department (1.1.1989 - not assigned)Faculty of Information Technology- beneficiary (1.1.2007 - 31.12.2009)
Results
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. Mathematical Theory of Conditional Grammars. New Delhi: 2008. p. 214-226.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
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. 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
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
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
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
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
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
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
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.; Š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.; KOPEČEK, T.; ŠVEC, M. Equivalent language models that closely simulate one another and their illustration in terms of L systems. International Journal of Computer Mathematics, 2007, vol. 2007, no. 84, p. 1555-1566. ISSN: 0020-7160.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.; 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
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.; 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 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
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
Responsibility: Meduna Alexandr, prof. RNDr., CSc.