prof. RNDr.
Alexandr Meduna
CSc.
FIT, UIFS – profesor
+420 54114 1232
meduna@fit.vut.cz
Publikace
2024
HAVEL, M.; KŘIVKA, Z.; MEDUNA, A. How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. In Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Göttingen: School of Computer Science and Engineering, University of New South Wales, 2024.
s. 86-99. ISSN: 2075-2180.
Detail | WWWMEDUNA, A.; KŘIVKA, Z. Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing. Boca Raton: CRC Press LLC, 2024. 293 s. ISBN: 978-0-367-62093-6.
Detail2023
KOŽÁR, T.; MEDUNA, A. Automata: Theory, Trends, And Applications. Singapore: World Scientific Publishing Co Pte Ltd, 2023. 436 s. ISBN: 978-981-1278-12-9.
DetailKOŽÁR, T.; MEDUNA, A.; KŘIVKA, Z. Final sentential forms. In Proceedings 13th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Famagusta: School of Computer Science and Engineering, University of New South Wales, 2023.
s. 38-47. ISSN: 2075-2180.
Detail | WWW2022
MARTIŠKO, J.; KŘIVKA, Z.; MEDUNA, A. CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. International Journal of Foundations of Computer Science, 2022, roč. 33, č. 03,
s. 335-348. ISSN: 0129-0541.
Detail | WWWKOCMAN, R.; KŘIVKA, Z.; MEDUNA, A.; NAGY, B. A Jumping 5'->3' Watson-Crick Finite Automata Model. Acta Informatica, 2022, roč. 59, č. 5,
s. 557-584. ISSN: 0001-5903.
Detail | WWWHAVEL, M.; MEDUNA, A. On Elimination of Erasing Rules from E0S Grammars. Computer Science Journal of Moldova, 2022, roč. 30, č. 2,
s. 135-147. ISSN: 1561-4042.
Detail | WWWKLOBUČNÍKOVÁ, D.; KŘIVKA, Z.; MEDUNA, A. Conclusive Tree-Controlled Grammars. In Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Debrecen: School of Computer Science and Engineering, University of New South Wales, 2022.
s. 112-125. ISSN: 2075-2180.
Detail | WWWKOLÁŘ, D.; MEDUNA, A.; TOMKO, M. Multi-Island Finite Automata and Their Even Computations. Kybernetika, 2022, roč. 57, č. 5,
s. 856-877. ISSN: 0023-5954.
Detail | WWW2021
KÖVÁRI, A.; KŘIVKA, Z.; MEDUNA, A. Evaluating Yona Language. In INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021. Lisabon: International Association for Development of the Information Society, 2021.
s. 101-108. ISBN: 978-989-8704-34-4.
Detail | WWWKŘIVKA, Z.; MEDUNA, A. Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundamenta Informaticae, 2021, roč. 179, č. 4,
s. 361-384. ISSN: 0169-2968.
Detail | WWW2020
KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. General CD Grammar Systems and Their Simplification. Journal of Automata, Languages and Combinatorics, 2020, roč. 25, č. 1,
s. 37-54. ISSN: 1430-189X.
Detail | WWWMEDUNA, A.; HORÁČEK, P.; TOMKO, M. Handbook of Mathematical Models for Languages and Computation. Stevenage, United Kingdom: The Institution of Engineering and Technology, 2020. 761 s. ISBN: 978-1-78561-659-4.
Detail | WWW2019
MEDUNA, A.; KRČMÁŘ, R.; KÖVÁRI, A.; BENÍČKOVÁ, Z. On Operations over Language Families. Computer Science Journal of Moldova, 2019, roč. 27, č. 3,
s. 255-282. ISSN: 1561-4042.
Detail | WWWMEDUNA, A.; KŘIVKA, Z.; KUČERA, J. Jumping Pure Grammars. COMPUTER JOURNAL, 2019, roč. 62, č. 1,
s. 30-41. ISSN: 0010-4620.
Detail | WWW2018
KOCMAN, R.; NAGY, B.; KŘIVKA, Z.; MEDUNA, A. A Jumping 5'->3' Watson-Crick Finite Automata Model. Tenth Workshop on Non-Classical Models of Automata and Applications (NCMA 2018). books@ocg.at 332. Wien: Austrian Computer Society, 2018.
s. 117-132. ISBN: 978-3-903035-21-8.
Detail | WWWCHARVÁT, L.; MEDUNA, A. A Reduction of Finitely Expandable Deep Pushdown Automata. Schedae Informaticae, 2018, roč. 2017, č. 26,
s. 61-68. ISSN: 0860-0295.
Detail | WWWCHARVÁT, L.; MEDUNA, A. Internally Expandable Pushdown Automata and Their Computational Completeness. Romanian Journal of Information Science and Technology (ROMJIST), 2018, roč. 21, č. 3,
s. 232-237. ISSN: 1453-8245.
Detail | WWWKUČERA, J.; KŘIVKA, Z.; MEDUNA, A. On k#$-Rewriting Systems. Romanian Journal of Information Science and Technology (ROMJIST), 2018, roč. 21, č. 3,
s. 278-287. ISSN: 1453-8245.
Detail | WWWKOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. On Double-Jumping Finite Automata and Their Closure Properties. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2018, roč. 52, č. 2,
s. 185-199. ISSN: 0988-3754.
Detail | WWW2017
MEDUNA, A.; SOUKUP, O.; CSUHAJ-VARJÚ, E. On Tree-Restricted Regular-Controlled Context-Free Grammars. International Journal of Computer Mathematics: Computer Systems Theory, 2017, roč. 2, č. 4,
s. 147-163. ISSN: 2379-9927.
Detail | WWWKOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. Rule-Homogeneous CD Grammar Systems. AFL 2017. Debrecen: 2017.
s. 0-0.
Detail | WWWCHARVÁT, L.; MEDUNA, A. A Reduction of Finitely Expandable Deep Pushdown Automata. Proceedings 12th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2017). Electronic Proceedings in Theoretical Computer Science. Telč: 2017.
s. 1 (1 s.).
Detail | WWWMEDUNA, A.; MARTIŠKO, J. CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. In 15th International Conference on Automata and Formal Languages. Electronic Proceedings in Theoretical Computer Science, EPTCS. Debrecen: Open Publishing Association, 2017.
s. 170-179. ISSN: 2075-2180.
Detail | WWWMEDUNA, A.; SOUKUP, O. Modern Language Models and Computation: Theory with Applications. New York: Springer US, 2017. 567 s. ISBN: 978-3-319-63099-1.
Detail | WWWMEDUNA, A.; SOUKUP, O. Jumping Scattered Context Grammars. Fundamenta Informaticae, 2017, roč. 152, č. 1,
s. 51-86. ISSN: 0169-2968.
Detail | WWW2016
MEDUNA, A.; SOUKUP, O. Simple Matrix Grammars and Their Leftmost Variants. International Journal of Foundations of Computer Science, 2016, roč. 27, č. 3,
s. 359-373. ISSN: 0129-0541.
Detail | WWWKOCMAN, R.; MEDUNA, A. On Parallel Versions of Jumping Finite Automata. In Proceedings of the 2015 Federated Conference on Software Development and Object Technologies. Advances in Intelligent Systems and Computing. Cham: Springer International Publishing, 2016.
s. 142-149. ISBN: 978-3-319-46534-0.
Detail | WWWKOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. On Double-Jumping Finite Automata. Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). books@ocg.at 321. Wien: Austrian Computer Society, 2016.
s. 195-210. ISBN: 978-3-903035-10-2.
Detail | WWWKUČERA, J.; MEDUNA, A. On State-Synchronized Automata Systems. Schedae Informaticae, 2016, roč. 2015, č. 24,
s. 221-237. ISSN: 0860-0295.
Detail | WWWKŘIVKA, Z.; MEDUNA, A.; ZEMEK, P. Phrase-Structure Grammars: Normal Forms and Reduction. COMPUTER JOURNAL, 2016, roč. 59, č. 8,
s. 1180-1185. ISSN: 0010-4620.
Detail | WWW2015
MEDUNA, A.; KUČERA, J.; SOUKUP, O. Absolutely Unlimited Deep Pushdown Automata. Proceedings of the 10th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2015). Telč: Ing. Vladislav Pokorný - Litera, 2015.
s. 36-44. ISBN: 978-80-214-5254-1.
Detail | WWWKŘIVKA, Z.; MEDUNA, A. Jumping Grammars. International Journal of Foundations of Computer Science, 2015, roč. 26, č. 6,
s. 709-731. ISSN: 0129-0541.
Detail | WWWMEDUNA, A.; SOUKUP, O.; ZEMEK, P. Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics, 2015, roč. 27, č. 1,
s. 25-47. ISSN: 1896-5334.
Detail | WWW2014
MEDUNA, A.; ZEMEK, P. Controlled Finite Automata. Acta Informatica, 2014, roč. 51, č. 5,
s. 327-337. ISSN: 0001-5903.
Detail | WWWMEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science, 2014, roč. 516, č. 1,
s. 127-132. ISSN: 0304-3975.
Detail | WWWMEDUNA, A.; ZEMEK, P. Regulated Grammars and Automata. New York: Springer US, 2014. 694 s. ISBN: 978-1-4939-0368-9.
Detail | WWWKOUTNÝ, J.; MEDUNA, A. On Normal Forms and Erasing Rules in Path-Controlled Grammars. Schedae Informaticae, 2014, roč. 2013, č. 22,
s. 9-18. ISSN: 0860-0295.
Detail | WWWKŘIVKA, Z.; SUBRAMANIAN, K.; MARTÍN-VIDE, C.; MEDUNA, A. A Variant of Pure Two-dimensional Context-free Grammars generating Picture Languages. In 16th International Workshop on Combinatorial Image Analysis. Lecture Notes in Computer Science. Lecture Notes in Computer Science, ISSN 0302-9743, Vol. 8466. Brno: Springer Verlag, 2014.
s. 123-133. ISBN: 978-3-319-07147-3. ISSN: 0302-9743.
Detail | WWWHORÁČEK, P.; MEDUNA, A. New Grammar Systems and Their Application Perspectives. Schedae Informaticae, 2014, roč. 2013, č. 22,
s. 47-68. ISSN: 0860-0295.
Detail | WWWMEDUNA, A.; VRÁBEL, L.; ZEMEK, P. Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems. International Journal of Computer Mathematics, 2014, roč. 91, č. 6,
s. 1156-1169. ISSN: 0020-7160.
Detail | WWWMEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars: A Survey. In Computing with New Resources. Berlin: Springer Verlag, 2014.
s. 338-351. ISBN: 978-3-319-13349-2.
Detail | WWWMEDUNA, A. Formal Languages and Computation. Taylor and Francis. Taylor and Francis. New York: Taylor & Francis Informa plc, 2014. 315 s. ISBN: 978-1-4665-1345-7.
DetailTESAŘ, R.; KŘIVKA, Z.; MEDUNA, A. Alan Mathison Turing - život a dílo. Pokroky matematiky, fyziky a astronomie, 2014, roč. 59, č. 2,
s. 89-104. ISSN: 0032-2423.
Detail | WWWMEDUNA, A.; SOUKUP, O. Computational Completeness Resulting from Scattered Context Grammars Working Under Various Derivation Modes. Proceedings of MEMICS'14. Brno: NOVPRESS s.r.o., 2014.
s. 89-100. ISBN: 978-80-214-5022-6.
Detail | WWW2013
MEDUNA, A.; ZEMEK, P. On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science, 2013, roč. 477, č. 1,
s. 67-75. ISSN: 0304-3975.
Detail | WWWMEDUNA, A.; ZEMEK, P. Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics, 2013, roč. 90, č. 2,
s. 172-182. ISSN: 0020-7160.
Detail | WWWMEDUNA, A.; ZEMEK, P. Left Random Context ET0L Grammars. Fundamenta Informaticae, 2013, roč. 123, č. 3,
s. 289-304. ISSN: 0169-2968.
Detail | WWW2012
HORÁČEK, P.; MEDUNA, A. Synchronous Versions of Regulated Grammars: Generative Power and Linguistic Applications. Theoretical and Applied Informatics, 2012, roč. 24, č. 3,
s. 175-190. ISSN: 1896-5334.
Detail | WWWMEDUNA, A.; VRÁBEL, L.; ZEMEK, P. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Braga: Springer Verlag, 2012.
s. 236-243. ISBN: 978-3-642-31622-7. ISSN: 0302-9743.
Detail | WWWMEDUNA, A.; ČERMÁK, M.; HORÁČEK, P. Rule-restricted automaton-grammar transducers: Power and linguistic applications. Mathematics for applications, 2012, roč. 1, č. 1,
s. 13-35. ISSN: 1805-3610.
Detail | WWWMEDUNA, A.; ZEMEK, P. Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica, 2012, roč. 49, č. 2,
s. 55-68. ISSN: 0001-5903.
Detail | WWWMEDUNA, A.; ČERMÁK, M.; HORÁČEK, P. Rule-Restricted Automaton-Grammar Transducers: Power and Linguistic Applications. 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: 2012.
s. 0-0. ISBN: 978-80-87342-15-2.
DetailKOUTNÝ, J.; MEDUNA, A. Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths. Kybernetika, 2012, roč. 48, č. 1,
s. 165-175. ISSN: 0023-5954.
Detail | WWWMEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars with Leftmost Derivations. In LNCS Festschrift Series: Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Berlin-Heidelberg: Springer Verlag, 2012.
s. 160-173. ISBN: 978-3-642-31643-2.
Detail | WWWMEDUNA, A.; ZEMEK, P. Controlled Pure Grammar Systems. Journal of Universal Computer Science, 2012, roč. 18, č. 14,
s. 2024-2040. ISSN: 0948-6968.
Detail | WWWMEDUNA, A.; ZEMEK, P. Jumping Finite Automata. International Journal of Foundations of Computer Science, 2012, roč. 23, č. 7,
s. 1555-1578. ISSN: 0129-0541.
Detail | WWWMEDUNA, A.; ZEMEK, P. One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics, 2012, roč. 89, č. 5,
s. 586-596. ISSN: 0020-7160.
Detail | WWW2011
MEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars. Acta Informatica, 2011, roč. 48, č. 3,
s. 149-163. ISSN: 0001-5903.
Detail | WWWĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. International Journal of Security and Its Applications, 2011, roč. 5, č. 4,
s. 91-106. ISSN: 1738-9976.
DetailMEDUNA, A.; ZEMEK, P. Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science, 2011, roč. 412, č. 35,
s. 4604-4612. ISSN: 0304-3975.
Detail | WWWĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. The 5th International Conference on Information Security and Assurance. Communications in Computer and Information Science, Volume 200. Brno: Springer Verlag, 2011.
s. 72-86. ISBN: 978-3-642-23140-7.
Detail | WWWČERMÁK, M.; MEDUNA, A. n-Accepting Restricted Pushdown Automata Systems. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2011.
s. 0-0. ISBN: 978-80-214-4305-1.
DetailĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2011.
s. 114-114. ISBN: 978-80-214-4305-1.
DetailMEDUNA, A.; VRÁBEL, L.; ZEMEK, P. On Nondeterminism in Programmed Grammars. 13th International Conference on Automata and Formal Languages. Debrecen: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011.
s. 316-328. ISBN: 978-615-5097-19-5.
DetailČERMÁK, M.; MEDUNA, A. n-Accepting Restricted Pushdown Automata Systems. 13th International Conference on Automata and Formal Languages. Nyíregyháza: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011.
s. 168-183. ISBN: 978-615-5097-19-5.
DetailČERMÁK, M.; KOUTNÝ, J.; MEDUNA, A. Parsing Based on n-Path Tree-Controlled Grammars. Theoretical and Applied Informatics, 2011, roč. 23, č. 3,
s. 213-228. ISSN: 1896-5334.
Detail | WWWZEMEK, P.; MEDUNA, A.; VRÁBEL, L. LL Leftmost k-Linear Scattered Context Grammars. AIP Conference Proceedings. AIP Conference Proceedings. Kassandra, Halkidiki: American Institute of Physics, 2011.
s. 833-836. ISBN: 978-0-7354-0956-9. ISSN: 1551-7616.
Detail | WWWKŘOUSTEK, J.; ŽIDEK, S.; KOLÁŘ, D.; MEDUNA, A. Scattered Context Grammars with Priority. International Journal of Advanced Research in Computer Science, 2011, roč. 2, č. 4,
s. 1-6. ISSN: 0976-5697.
DetailĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of an Automatically Generated Retargetable Decompiler. 2nd European Conference of COMPUTER SCIENCE (ECCS'11). Puerto De La Cruz, Tenerife: North Atlantic University Union, 2011.
s. 199-204. ISBN: 978-1-61804-056-5.
DetailKOUTNÝ, J.; KŘIVKA, Z.; MEDUNA, A. Pumping Properties of Path-Restricted Tree-Controlled Languages. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Brno University of Technology, 2011.
s. 61-69. ISBN: 978-80-214-4305-1.
DetailĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Advanced Static Analysis for Decompilation Using Scattered Context Grammars. Proceedings of the Applied Computing Conference 2011 (ACC'11). Angers: World Scientific and Engineering Academy, 2011.
s. 164-169. ISBN: 978-1-61804-051-0.
DetailHORÁČEK, P.; MEDUNA, A. Regulated Rewriting in Natural Language Translation. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Brno University of Technology, 2011.
s. 35-42. ISBN: 978-80-214-4305-1.
DetailŽIDEK, S.; MEDUNA, A. Scattered Context Grammars Generating Sentences Followed by Derivation Trees. Theoretical and Applied Informatics, 2011, roč. 23, č. 2,
s. 97-106. ISSN: 1896-5334.
Detail | WWWMEDUNA, A.; ČERMÁK, M.; MASOPUST, T. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae, 2011, roč. 2010, č. 19,
s. 23-34. ISSN: 0860-0295.
Detail2010
MEDUNA, A.; TECHET, J. Scattered Context Grammars and their Applications. WIT Press, UK. WIT Press, UK. WIT Press, UK: WIT Press, 2010. 224 s. ISBN: 978-1-84564-426-0.
DetailLUKÁŠ, R.; MEDUNA, A. Multigenerative Grammar Systems and Matrix Grammars. Kybernetika, 2010, roč. 46, č. 1,
s. 68-82. ISSN: 0023-5954.
Detail | WWWMASOPUST, T.; GOLDEFUS, F.; MEDUNA, A. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, 2010, roč. 411, č. 40,
s. 3661-3667. ISSN: 0304-3975.
DetailMEDUNA, A. Finitely Expandable Deep PDAs. In Automata, Formal Languages and Algebraic Systems. Hong Kong: Hong Kong University of Scinece and Technology, 2010.
s. 113-123. ISBN: 981-4317-60-8.
DetailMEDUNA, A.; ZEMEK, P. Regulated Grammars and Their Transformations. Brno: Brno University of Technology, 2010. 239 s. ISBN: 978-80-214-4203-0.
DetailKŘOUSTEK, J.; ŽIDEK, S.; KOLÁŘ, D.; MEDUNA, A. Exploitation of Scattered Context Grammars to Model VLIW Instruction Constraints. In Proceedings of the 12th Biennial Baltic Electronics Conference. Tallinn: Institute of Electrical and Electronics Engineers, 2010.
s. 165-168. ISBN: 978-1-4244-7357-1.
Detail | WWW2009
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.
s. 235-245. ISBN: 978-3-940961-31-0.
Detail | WWWMEDUNA, A.; TECHET, J. An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. Theoretical Computer Science, 2009, roč. 410, č. 21,
s. 1961-1969. ISSN: 0304-3975.
DetailMASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, 2009, roč. 19, č. 2,
s. 537-552. ISSN: 0324-721X.
DetailMASOPUST, T.; MEDUNA, A. On context-free rewriting with a simple restriction and its computational completeness. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, roč. 43, č. 2,
s. 365-378. ISSN: 0988-3754.
Detail | WWWMEDUNA, A.; GOLDEFUS, F. Weak Leftmost Derivations in Cooperative Distributed Grammar Systems. MEMICS 09. Brno: Brno University of Technology, 2009.
s. 144-151. ISBN: 978-80-87342-04-6.
Detail2008
MEDUNA, A. New Trends in Algebraic Theory of Automata. ICDMA. Bangkok: University of South Australia, 2008.
s. 211-222. ISBN: 0-7167-8261-8.
DetailMASOPUST, 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.
s. 325-336. ISBN: 978-963-311-367-7.
DetailMEDUNA, A. Mathematical Theory of Conditional Grammars. New Delhi: 2008.
s. 214-226.
DetailMEDUNA, 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 | WWWMASOPUST, T.; MEDUNA, A. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, 2008, roč. 87, č. 3,
s. 407-415. ISSN: 0169-2968.
Detail | WWWMASOPUST, T.; MEDUNA, A.; ŠIMÁČEK, J. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, 2008, roč. 18, č. 4,
s. 783-793. ISSN: 0324-721X.
Detail | WWWMEDUNA, A.; TECHET, J. Scattered Context Grammars that Erase Nonterminals in a Generalized k-Limited Way. Acta Informatica, 2008, roč. 45, č. 7,
s. 593-608. ISSN: 0001-5903.
Detail | WWWKOPEČEK, T.; MEDUNA, A. Conditional Grammars and Their Reduction. Brno: Faculty of Information Technology BUT, 2008. 138 s. ISBN: 978-80-214-3750-0.
DetailMEDUNA, A. Elements of Compiler Design. Taylor and Francis. Taylor and Francis. New York: Taylor & Francis Informa plc, 2008. 304 s. ISBN: 978-1-4200-6323-3.
Detail2007
MEDUNA, A.; TECHET, J. Maximal and Minimal Scattered Context Rewriting. FCT 2007 Proceedings. Lecture Notes in Computer Science. Budapest: Springer Verlag, 2007.
s. 412-423. ISSN: 0302-9743.
DetailMEDUNA, A.; TECHET, J. Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras: University of Pavol Jozef Šafárik, 2007.
s. 178-185. ISBN: 978-80-7097-688-3.
DetailMEDUNA, 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, roč. 2007, č. 84,
s. 1555-1566. ISSN: 0020-7160.
DetailKŘIVKA, Z.; MEDUNA, A. Generalized #-Rewriting Systems of Finite Index. Information Systems and Formal Models (Proceedings of 2nd International Workshop on Formal Models (WFM'07)). Opava: Silesian University, 2007.
s. 197-204. ISBN: 978-807248-006-7.
Detail | WWWBIDLO, R.; BLATNÝ, P.; MEDUNA, A. Context-Free and E0L Derivations over Free Groups. Schedae Informaticae, 2007, roč. 2007, č. 16,
s. 14-24. ISSN: 0860-0295.
DetailLUKÁŠ, R.; MEDUNA, A. General Multigenerative Grammar Systems. Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravicí: Silesian University, 2007.
s. 205-212. ISBN: 978-80-7248006-7.
DetailKŘIVKA, Z.; MEDUNA, A.; SMRČEK, J. n-Right-Linear #-Rewriting Systems. Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007.
s. 105-112. ISBN: 978-80-7355-077-6.
Detail | WWWMASOPUST, T.; MEDUNA, A. Descriptional Complexity of Grammars Regulated by Context Conditions. LATA 2007 Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili. Tarragona, Spain: 2007.
s. 403-411.
DetailBIDLO, R.; BLATNÝ, P.; MEDUNA, A. Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. Kybernetika, 2007, roč. 2007, č. 1,
s. 21-35. ISSN: 0023-5954.
DetailMEDUNA, A.; TECHET, J. Canonical Scattered Context Generators of Sentences with Their Parses. Theoretical Computer Science, 2007, roč. 2007, č. 389,
s. 73-81. ISSN: 0304-3975.
DetailMEDUNA, A.; LUKÁŠ, R.; FIALA, J. Homogeneous Multicontinuous Grammars and Their Reduction. MEMICS 2007 Proceedings. Znojmo: Ing. Zdeněk Novotný, CSc., 2007.
s. 90-96. ISBN: 978-80-7355-077-6.
DetailMASOPUST, T.; MEDUNA, A. Descriptional Complexity of Semi-Conditional Grammars. Information Processing Letters, 2007, roč. 104, č. 1,
s. 29-31. ISSN: 0020-0190.
Detail | WWWMASOPUST, T.; MEDUNA, A. Descriptional Complexity of Generalized Forbidding Grammars. Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras, Slovakia: University of Pavol Jozef Šafárik, 2007.
s. 170-177. ISBN: 978-80-7097-688-3.
DetailMEDUNA, A.; MASOPUST, T. Self-Regulating Finite Automata. Acta Cybernetica, 2007, roč. 18, č. 1,
s. 135-153. ISSN: 0324-721X.
Detail | WWW2006
MEDUNA, A. Deep Pushdown Automata. Acta Informatica, 2006, roč. 2006, č. 98,
s. 114-124. ISSN: 0001-5903.
DetailMEDUNA, A.; BIDLO, R.; BLATNÝ, P. Vertical Context in Phrase-Structure Grammars. Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov: Brno University of Technology, 2006.
s. 17-23. ISBN: 80-214-3287-X.
DetailKŘIVKA, Z.; MEDUNA, A.; SCHÖNECKER, R. Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, 2006, roč. 17, č. 5,
s. 1223-1229. ISSN: 0129-0541.
Detail | WWWMEDUNA, A.; LUKÁŠ, R. Multigenerative Grammar Systems. Schedae Informaticae, 2006, roč. 2006, č. 15,
s. 175-188. ISSN: 0860-0295.
DetailLUKÁŠ, R.; MEDUNA, A. Multigenerative Grammar Systems. Proceedings of 1st International Workshop - WFM. Přerov: Marq software s.r.o., 2006.
s. 19-26. ISBN: 80-86840-20-4.
DetailKŘIVKA, Z.; MEDUNA, A. General Top-Down Parsers Based On Deep Pushdown Expansions. Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: Marq software s.r.o., 2006.
s. 11-18. ISBN: 80-86840-20-4.
DetailSCHÖ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.
s. 214-221. ISBN: 80-214-3287-X.
DetailKŘIVKA, Z.; LUKÁŠ, R.; MEDUNA, A. Didaktické demonstrace modelů pro popis formálních jazyků. Pedagogický software 2006. České Budějovice: Zemědělská fakulta, Jihočeská univerzita, 2006.
s. 54-56. ISBN: 80-85645-56-4.
Detail2005
LORENC, L.; MEDUNA, A. Self-Reproducing Translation Made by Pushdown Transducers. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005.
s. 59-67.
DetailLUKÁŠ, R.; MEDUNA, A. Multigenerative Grammar Systems. Pre-proceedings 1st Doctoral Workshop on Mathematical and Engineering Methods in Comupter Science (MEMICS 2005). Brno: Faculty of Informatics MU, 2005.
s. 85-87.
DetailKŘ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: Marq software s.r.o., 2005.
s. 67-72. ISBN: 80-86840-09-3.
DetailMEDUNA, A.; ŠVEC, M. Grammars with Context Conditions and Their Applications [Wiley, 2004]. Wiley, New York: WILEY, 2005. 225 s. ISBN: 0-471-71831-9.
Detail | WWWMEDUNA, A.; TECHET, J. Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybernetica, 2005, roč. 17, č. 1,
s. 11-20. ISSN: 0324-721X.
DetailBIDLO, R.; BLATNÝ, P.; MEDUNA, A. Formal Models over Free Groups. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005.
s. 193-199. ISBN: 0.
DetailLORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. Kybernetika, 2005, roč. 2005, č. 4,
s. 533-539. ISSN: 0023-5954.
DetailKOLÁŘ, 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: Marq software s.r.o., 2005.
s. 33-48. ISBN: 80-86840-09-3.
DetailLORENC, 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: Marq software s.r.o., 2005.
s. 51-58. ISBN: 80-86840-09-3.
DetailKOPEČEK, T.; MEDUNA, A.; ŠVEC, M. Simulation of Scattered Context Grammars and Phrase-Structured Grammars by Symbiotic E0L Grammars. In Proceeding of 8th International Conference on Information Systems Implementation and Modelling ISIM'05. Brno: 2005.
s. 59-66. ISBN: 80-86840-09-3.
DetailMEDUNA, A.; LUKÁŠ, R. A Note on Iteratively Extendable Strings. Rostocker mathematisches kolloquium, 2005, roč. 2005, č. 59,
s. 71-73. ISSN: 0138-3248.
Detail2004
ELBL, S.; MEDUNA, A. Finite Index in Language Theory. Proceedings of 10th Conference and Competition STUDENT EEICT 2004. Brno: Faculty of Information Technology BUT, 2004.
s. 247-251. ISBN: 80-214-2635-7.
DetailELBL, S.; MEDUNA, A. Grammar Systems of Finite Index. Proceedings of 7th International Conference ISIM '04. Ostrava: Marq software s.r.o., 2004.
s. 141-146. ISBN: 80-85988-99-2.
DetailLORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: Marq software s.r.o., 2004.
s. 155-160. ISBN: 80-85988-99-2.
DetailKOPEČEK, T.; MEDUNA, A. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, 2004, roč. 2004, č. 23,
s. 287-302. ISSN: 1335-9150.
DetailMEDUNA, A.; ŠKRKAL, O. Combined Leftmost Derivations in Matrix Grammars. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: Marq software s.r.o., 2004.
s. 127-132. ISBN: 80-85988-99-2.
DetailMEDUNA, A.; VÍTEK, M. New language operations in formal language theory. Schedae Informaticae, 2004, roč. 2004, č. 13,
s. 123-150. ISSN: 0860-0295.
DetailMEDUNA, A. Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybernetica, 2004, roč. 2004, č. 16,
s. 385-397. ISSN: 0324-721X.
Detail2003
MEDUNA, A. Coincidental Extention of Scattered Context Languages. Acta Informatica, 2003, roč. 2003, č. 112,
s. 307-314. ISSN: 0001-5903.
DetailMEDUNA, A.; ŠVEC, M. Forbidding ET0L Systems. Theoretical Computer Science, 2003, roč. 2003, č. 306,
s. 449-469. ISSN: 0304-3975.
DetailMEDUNA, A.; HRUŠKA, T. Ulice ponese jméno geniálního matematika a brněnského rodáka (o Gödelovi). Události na VUT v Brně, 2003, roč. 2003, č. 10,
s. 24-24. ISSN: 1211-4421.
DetailMEDUNA, A. On the Degree of Scattered Context-Sensitivity. Theoretical Computer Science, 2003, roč. 2003, č. 290,
s. 2121-2124. ISSN: 0304-3975.
DetailMEDUNA, A.; ŠVEC, M. Descriptional Complexity of Generalized Forbidding Grammars. International Journal of Computer Mathematics, 2003, roč. 2003, č. 80,
s. 11-17. ISSN: 0020-7160.
DetailMEDUNA, A. Simultaneously One-Turn Two-Pushdown Automata. International Journal of Computer Mathematics, 2003, roč. 2003, č. 80,
s. 679-687. ISSN: 0020-7160.
DetailMEDUNA, A. A Simultaneous Reduction of Several Measures of Descriptional Complexity in Scattered Context Grammars. Information Processing Letters, 2003, roč. 2003, č. 86,
s. 235-240. ISSN: 0020-0190.
Detail2002
HRUBÝ, M.; MEDUNA, A.; VURM, P. Model syntaktické analýzy formálních jazyků. Proceedings of XXIVth International Autumn Colloquium ASIS 2002. Ostrava: Marq software s.r.o., 2002.
s. 109-114. ISBN: 80-85988-77-1.
Detail | WWWMEDUNA, A. Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. Journal of Automata, Languages and Combinatorics, 2002, roč. 2002, č. 7,
s. 571-577. ISSN: 1430-189X.
DetailCHVALINA, J., MEDUNA, A., NOVÁK, V. Profesor Miroslav Novotný osmdesátiletý. Pokroky matematiky, fyziky a astronomie, 2002, roč. 2002, č. 2,
s. 168 ( s.) ISSN: 0032- 2423.
DetailKOLÁŘ, D.; MEDUNA, A. Homogenous Grammars with a Reduced Number of Non-Context-Free Productions. Information Processing Letters, 2002, roč. 2002, č. 81,
s. 253-257. ISSN: 0020-0190.
DetailMEDUNA, A.; ŠVEC, M. Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. Acta Cybernetica, 2002, roč. 2002, č. 15,
s. 353-360. ISSN: 0324-721X.
Detail2001
MEDUNA, A.; KOLÁŘ, D. One-Turn Regulated Pushdown Automata and Their Reduction. Fundamenta Informaticae, 2001, roč. 2001, č. 21,
s. 1001-1007. ISSN: 0169-2968.
DetailMEDUNA, A. Descriptional Complexity of Partially Parallel Grammars. DCAGRS. Vienna: 2001.
s. 15-21. ISBN: 0-7167-8261-8.
DetailMEDUNA, A.; VURM, P. Multisequential Grammars with Homogeneous Selectors. International Journal of Computer Mathematics, 2001, roč. 2001, č. 34,
s. 1-7. ISSN: 0020-7160.
DetailMEDUNA, A. Uniform Generation of Languages by Scattered Context Grammars. Fundamenta Informaticae, 2001, roč. 2001, č. 45,
s. 231-235. ISSN: 0169-2968.
Detail2000
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.
s. 212-225. ISBN: 1-85233-074-0.
DetailKOLÁŘ, D.; MEDUNA, A. Regulated Pushdown Automata. Acta Cybernetica, 2000, roč. 2000, č. 4,
s. 653-664. ISSN: 0324-721X.
DetailMEDUNA, A. Terminating Left-Hand Sides of Scattered Context Grammars. Theoretical Computer Science, 2000, roč. 2000, č. 237,
s. 424-427. ISSN: 0304-3975.
DetailMEDUNA, A. Context-Free Multirewriting with a Reduced Number of Nonterminals. Brno: Brno University of Technology, 2000.
s. 0-0.
DetailMEDUNA, A. Generative Power of Three-Nonterminal Scattered Context Grammars. Theoretical Computer Science, 2000, roč. 2000, č. 246,
s. 279-284. ISSN: 0304-3975.
Detail1999
MEDUNA, A. Prefix Pushdown Automata. International Journal of Computer Mathematics, 1999, roč. 1999, č. 71,
s. 1-20. ISSN: 0020-7160.
Detail1998
MEDUNA, A. Uniform Rewriting Based on Permutations. International Journal of Computer Mathematics, 1998,
s. 57-74. ISSN: 0020-7160.
DetailMEDUNA, A. Economical Transformations of Scattered Context Grammars to Phrase-Structure Grammars. Acta Cybernetica, 1998, roč. 1998, č. 13,
s. 225-242. ISSN: 0324-721X.
DetailMEDUNA, A. Descriptional Complexity of Multi-Continues Grammars. Acta Cybernetica, 1998, roč. 1998, č. 13,
s. 375-384. ISSN: 0324-721X.
DetailMEDUNA, A. Middle Quotients of Linear Languages. International Journal of Computer Mathematics, 1998,
s. 281-289. ISSN: 0020-7160.
Detail1997
MEDUNA, A. Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages. International Journal of Computer Mathematics, 1997, roč. 1997, č. 63,
s. 67-83. ISSN: 0020-7160.
DetailMEDUNA, A. Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages. International Journal of Computer Mathematics, 1997, roč. 1997, č. 65,
s. 179-189. ISSN: 0020-7160.
DetailMEDUNA, A. On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. In New Trends in Formal Languages: Control, Cooperation, and Combinatorics. New York: Springer Verlag, 1997.
s. 27-39.
Detail1996
MEDUNA, A. Syntactic Complexity of Context-Free Grammars over Word Monoids. Acta Informatica, 1996, roč. 1996, č. 33,
s. 457-462. ISSN: 0001-5903.
Detail1995
MEDUNA, A. A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars. Bulletin of the European Association for Theoretical Computer Science, 1995, roč. 1995, č. 56,
s. 1-3. ISSN: 0252-9742.
DetailMEDUNA, A. Syntactic Complexity of Scattered Context Grammars. Acta Informatica, 1995, roč. 1995, č. 32,
s. 285-298. ISSN: 0001-5903.
DetailMEDUNA, A. Symbiotic E0L Systems. In Artifical Life:Grammatical Models. Bucharest: unknown, 1995.
s. 122-129.
Detail1994
MEDUNA, A. Matrix Grammars under Leftmost and Rightmost Restrictions. In Mathematical Linguistics and Related Topics. Bucharest: unknown, 1994.
s. 243-257.
DetailGOPALARATNAM, A.; MEDUNA, A. On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Kybernetika, 1994, roč. 1994, č. 11,
s. 307-324. ISSN: 0023-5954.
Detail1993
MEDUNA, A. Canonical Scattered Rewriting. International Journal of Computer Mathematics, 1993,
s. 122-129. ISSN: 0020-7160.
DetailMEDUNA, A. A Formalization of Sequential, Parallel, and Continuous Rewriting. International Journal of Computer Mathematics, 1993, roč. 1993, č. 47,
s. 153-161. ISSN: 0020-7160.
DetailCROOKS, C.; MEDUNA, A.; ŠÁREK, M. Syntactic Complexity of Regulated Rewriting. Kybernetika, 1993, roč. 1993, č. 30,
s. 177-186. ISSN: 0023-5954.
DetailCSUHAJ-VARJÚ, E.; MEDUNA, A. Grammars with Context Conditions. Kybernetika, 1993,
s. 199-213. ISSN: 0023-5954.
DetailMEDUNA, A. Parallel Formal Models in the Formal Language Theory. Missourian Annual Conference on Computing. Columbia: 1993.
s. 78-82.
Detail1992
MEDUNA, A. L Systems and Their Applications. Missourian Annual Conference on Computing. Columbia: 1992.
s. 56-62.
DetailMEDUNA, A. Symbiotic E0L Systems. Acta Cybernetica, 1992, roč. 1992, č. 10,
s. 165-172. ISSN: 0324-721X.
Detail1991
MEDUNA, A. Scattered Rewriting in the Formal Language Theory. Missourian Annual Conference on Computing. Columbia: 1991.
s. 26-36.
DetailMEDUNA, A. Controlled Systolic Automata. Parallel Computation in the Midwestern Academic Environment. Rolla: 1991.
s. 56-66.
DetailMEDUNA, A. Global Context Conditional Grammars. Journal of Automata, Languages and Combinatorics, 1991, roč. 1991, č. 27,
s. 159-165. ISSN: 1430-189X.
Detail1990
MEDUNA, A. Parallel Compilers Based on L Systems. Parallel Computation in the Midwestern Academic Environment. Rolla: 1990.
s. 215-224.
DetailMEDUNA, A. Regulated Rewriting. Missourian Annual Conference on Computing. Columbia: 1990.
s. 25-31.
DetailMEDUNA, A. Generalized Forbidding Grammars. International Journal of Computer Mathematics, 1990,
s. 31-38. ISSN: 0020-7160.
DetailMEDUNA, A. Context-Free Derivations on Word Monoids. Acta Informatica, 1990, roč. 1990, č. 27,
s. 781-786. ISSN: 0001-5903.
Detail1988
HORVAT, G.; MEDUNA, A. On State Grammars. Acta Cybernetica, 1988, roč. 1988, č. 8,
s. 237-245. ISSN: 0324-721X.
Detail1987
MEDUNA, A. Characterization of the Chomsky Hierarchy through Sequential-Parallel Grammars. Rostocker mathematisches kolloquium, 1987, roč. 1987, č. 32,
s. 4-14. ISSN: 0138-3248.
DetailMEDUNA, A. Grammars, Automata, and Compilers. Brno: unknown, 1987.
s. 0-0.
DetailMEDUNA, A. Evaluated Grammars. Acta Cybernetica, 1987, roč. 1987, č. 8,
s. 169-176. ISSN: 0324-721X.
Detail1986
MEDUNA, A. A Note on Exponential Density of ET0L Languages. Kybernetika, 1986, roč. 1986, č. 22,
s. 514-518. ISSN: 0023-5954.
DetailMEDUNA, A.; ZATLOUKAL, A. A General System for Sorting and Print. 1986,
s. 30-38.
DetailMEDUNA, A.; VIČAROVÁ, Z. Operating Systems II. Olomouc: unknown, 1986.
s. 0-0.
Detail1984
MEDUNA, A.; VIČAROVÁ, Z. Operating Systems I. Olomouc: unknown, 1984.
s. 0-0.
Detail
*) Citace publikací se generují jednou za 24 hodin.