Výzkumná skupina formálních modelů

Publikace

2017MEDUNA Alexander a SOUKUP Ondřej. Jumping Scattered Context Grammars. Fundamenta Informaticae. Amsterdam: IOS Press, 2017, roč. 2017, č. 152, s. 1-36. ISSN 0169-2968.
2016KOCMAN Radim a MEDUNA Alexander. On Parallel Versions of Jumping Finite Automata. In: Proceedings of the 2015 Federated Conference on Software Development and Object Technologies. Cham: Springer International Publishing, 2016, s. 142-149. ISBN 978-3-319-46534-0.
 KOCMAN Radim, KŘIVKA Zbyněk a MEDUNA Alexander. On Double-Jumping Finite Automata. In: Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). Wien: Osterreichische Computer Gesellschaft, 2016, s. 195-210. ISBN 978-3-903035-10-2.
 KUČERA Jiří a MEDUNA Alexander. On State-Synchronized Automata Systems. Schedae Informaticae. Krakov: 2016, roč. 2015, č. 24, s. 221-237. ISSN 0860-0295.
 KŘIVKA Zbyněk, MEDUNA Alexander a ZEMEK Petr. Phrase-Structure Grammars: Normal Forms and Reduction. The Computer Journal. Oxford: Oxford University Press, 2016, roč. 59, č. 8, s. 1180-1185. ISSN 0010-4620.
 MEDUNA Alexander a SOUKUP Ondřej. Simple Matrix Grammars and Their Leftmost Variants. International Journal of Foundations of Computer Science. 2016, roč. 27, č. 3, s. 359-373. ISSN 0129-0541.
2015KUČERA Jiří, MEDUNA Alexander a SOUKUP Ondřej. Absolutely Unlimited Deep Pushdown Automata. In: 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.
 KŘIVKA Zbyněk a MEDUNA Alexander. Jumping Grammars. International Journal of Foundations of Computer Science. 2015, roč. 26, č. 6, s. 709-731. ISSN 0129-0541.
 MEDUNA Alexander, SOUKUP Ondřej a ZEMEK Petr. Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics. Varšava: 2015, roč. 27, č. 1, s. 25-47. ISSN 1896-5334.
2014HORÁČEK Petr a MEDUNA Alexander. New Grammar Systems and Their Application Perspectives. Schedae Informaticae. Krakov: 2014, roč. 2013, č. 22, s. 47-68. ISSN 0860-0295.
 KOUTNÝ Jiří a MEDUNA Alexander. On Normal Forms and Erasing Rules in Path-Controlled Grammars. Schedae Informaticae. Krakov: 2014, roč. 2013, č. 22, s. 9-18. ISSN 0860-0295.
 KUČERA Jiří. On Determinism in State-Synchronized Automata Systems. In: Proceedings of the 20th Conference STUDENT EEICT 2014. Brno: Vysoké učení technické v Brně, 2014, s. 259-263. ISBN 978-80-214-4924-4.
 KŘIVKA Zbyněk, MARTÍN-VIDE Carlos, MEDUNA Alexander a SUBRAMANIAN K.G. A Variant of Pure Two-dimensional Context-free Grammars generating Picture Languages. In: 16th International Workshop on Combinatorial Image Analysis. Brno: Springer Verlag, 2014, s. 123-133. ISBN 978-3-319-07147-3. ISSN 0302-9743.
 MEDUNA Alexander a SOUKUP Ondřej. Computational Completeness Resulting from Scattered Context Grammars Working Under Various Derivation Modes. In: Proceedings of MEMICS'14. Brno: NOVPRESS s.r.o., 2014, s. 89-100. ISBN 978-80-214-5022-6.
 MEDUNA Alexander a ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9.
 MEDUNA Alexander a ZEMEK Petr. Controlled Finite Automata. Acta Informatica. 2014, roč. 51, č. 5, s. 327-337. ISSN 0001-5903.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science. Paris: Elsevier Science, 2014, roč. 516, č. 1, s. 127-132. ISSN 0304-3975.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Random Context Grammars: A Survey. Lecture Notes in Computer Science. 2014, roč. 2014, č. 8808, s. 338-351. ISBN 978-3-319-13349-2. ISSN 0302-9743.
 MEDUNA Alexander, VRÁBEL Lukáš a ZEMEK Petr. 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.
 MEDUNA Alexander. Formal Languages and Computation. New York: Taylor & Francis Informa plc, 2014. ISBN 978-1-4665-1345-7.
 SOLÁR Peter. Deep Pushdown Transducers and State Translation Schemes. In: Proceedings of the 20th Conference STUDENT EEICT 2014 Volume 3. Brno: Vysoké učení technické v Brně, 2014, s. 264-268. ISBN 978-80-214-4924-4.
 ZEMEK Petr. One-Sided Random Context Grammars. Brno, 2014.
2013HORÁČEK Petr. Application Perspectives of Synchronous Matrix Grammars. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Vysoké učení technické v Brně, 2013, s. 202-206. ISBN 978-80-214-4695-3.
 KUČERA Jiří. A Combination of Automata and Grammars. Brno: Fakulta informačních technologií VUT v Brně, 2013.
 KUČERA Jiří. On State-Synchronized Automata Systems. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 2. Brno: Vysoké učení technické v Brně, 2013, s. 216-218. ISBN 978-80-214-4694-6.
 MEDUNA Alexander a ZEMEK Petr. Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics. 2013, roč. 90, č. 2, s. 172-182. ISSN 0020-7160.
 MEDUNA Alexander a ZEMEK Petr. Left Random Context ET0L Grammars. Fundamenta Informaticae. Amsterdam: IOS Press, 2013, roč. 123, č. 3, s. 289-304. ISSN 0169-2968.
 MEDUNA Alexander a ZEMEK Petr. On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science. Paris: Elsevier Science, 2013, roč. 477, č. 1, s. 67-75. ISSN 0304-3975.
 SOLÁR Peter. Deep Pushdown Transducers and Parallel Deep Pushdown Transducers. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Vysoké učení technické v Brně, 2013, s. 207-211. ISBN 978-80-214-4695-3.
 VRÁBEL Lukáš. On Stateless Pushdown Automata And Limited Pushdown Alphabets. Vysoké učení technické v Brně, 2013.
 ZEMEK Petr. One-Sided Random Context Grammars: Established Results and Open Problems. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Vysoké učení technické v Brně, 2013, s. 222-226. ISBN 978-80-214-4695-3.
2012HORÁČEK Petr a MEDUNA Alexander. Synchronous Versions of Regulated Grammars: Generative Power and Linguistic Applications. Theoretical and Applied Informatics. Varšava: 2012, roč. 24, č. 3, s. 175-190. ISSN 1896-5334.
 HORÁČEK Petr. On Generative Power of Synchronous Grammars with Linked Rules. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 376-380. ISBN 978-80-214-4462-1.
 JIRÁK Ota. Memory Consumption of Classical and Lazy Scattered Context Grammar Parser. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 381-385. ISBN 978-80-214-4462-1.
 KOUTNÝ Jiří a MEDUNA Alexander. Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths. Kybernetika. 2012, roč. 48, č. 1, s. 165-175. ISSN 0023-5954.
 KOUTNÝ Jiří. Grammars with Restricted Derivation Trees. Brno, 2012.
 KOUTNÝ Jiří. On Path-Controlled Grammars and Pseudoknots. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 391-395. ISBN 978-80-214-4462-1.
 MEDUNA Alexander a ZEMEK Petr. Controlled Pure Grammar Systems. Journal of Universal Computer Science. 2012, roč. 18, č. 14, s. 2024-2040. ISSN 0948-6968.
 MEDUNA Alexander a ZEMEK Petr. Jumping Finite Automata. International Journal of Foundations of Computer Science. 2012, roč. 23, č. 7, s. 1555-1578. ISSN 0129-0541.
 MEDUNA Alexander a ZEMEK Petr. Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica. 2012, roč. 49, č. 2, s. 55-68. ISSN 0001-5903.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics. 2012, roč. 89, č. 5, s. 586-596. ISSN 0020-7160.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Random Context Grammars with Leftmost Derivations. Lecture Notes in Computer Science. 2012, roč. 2012, č. 7300, s. 160-173. ISBN 978-3-642-31643-2. ISSN 0302-9743.
 MEDUNA Alexander, VRÁBEL Lukáš a ZEMEK Petr. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. In: DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems. Braga: Springer Verlag, 2012, s. 236-243. ISBN 978-3-642-31622-7. ISSN 0302-9743.
 SOLÁR Peter. Parallel deep pushdown automata. In: Proceedings of the 18th Conference STUDENT EEICT 2012. Brno: Vysoké učení technické v Brně, 2012, s. 410-414. ISBN 978-80-214-4462-1.
 VRÁBEL Lukáš. A New Normal Form for Programmed Grammars with Appearance Checking. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 420-425. ISBN 978-80-214-4462-1.
 ZEMEK Petr. Normal Forms of One-Sided Random Context Grammars. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 430-434. ISBN 978-80-214-4462-1.
 ČERMÁK Martin, HORÁČEK Petr a MEDUNA Alexander. Rule-Restricted Automaton-Grammar Transducers: Power and Linguistic Applications. 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno, 2012. ISBN 978-80-87342-15-2.
 ČERMÁK Martin, HORÁČEK Petr a MEDUNA Alexander. Rule-restricted automaton-grammar transducers: Power and linguistic applications. Mathematics for Applications. Brno: Ústav matematiky FEKT VUT v Brně, 2012, roč. 1, č. 1, s. 13-35. ISSN 1805-3610.
 ČERMÁK Martin, KOUTNÝ Jiří a MEDUNA Alexander. Parsing Based on n-Path Tree-Controlled Grammars. Theoretical and Applied Informatics. Varšava: 2012, roč. 2011, č. 23, s. 213-228. ISSN 1896-5334.
 ČERMÁK Martin. Formal Systems Based on Automata and Grammars. Brno, 2012.
 ČERMÁK Martin. Restrictions on Derivations in n-Generating Grammar Systems. In: Proceedings of the 18th Conference and Competition STUDENT EEICT 2012 Volume 5. Brno: Fakulta informačních technologií VUT v Brně, 2012, s. 371-375. ISBN 978-80-214-4462-1.

Zobrazit všechny publikace

Disertační a habilitační práce

2014ZEMEK Petr. One-Sided Random Context Grammars. Brno, 2014.
2012KOUTNÝ Jiří. Grammars with Restricted Derivation Trees. Brno, 2012.
 ČERMÁK Martin. Formal Systems Based on Automata and Grammars. Brno, 2012.
2008TECHET Jiří. Scattered Context in Formal Languages. Brno: Fakulta informačních technologií VUT v Brně, 2008.
2007KŘIVKA Zbyněk. Přepisující systémy s omezenými konfiguracemi. Brno, 2007.
 MASOPUST Tomáš. Regulated Formal Models and Their Reduction. Brno, 2007.

Vaše IPv4 adresa: 54.166.14.86
Přepnout na IPv6 spojení

DNSSEC [dnssec]