Ing.

Martin Havel

Ph.D. student


ihavelm@fit.vut.cz
C220 Office
213265/BUT personal ID

Publications

  • 2025

    HAVEL, M.; KŘIVKA, Z.; MEDUNA, A. Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals Are Computationally Complete. In Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Loughborough: Springer Verlag, 2025. p. 123-136. ISBN: 978-3-031-97099-3. ISSN: 0302-9743. Detail

  • 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. p. 86-99. ISSN: 2075-2180. Detail

  • 2022

    HAVEL, M.; MEDUNA, A. On Elimination of Erasing Rules from E0S Grammars. Computer Science Journal of Moldova, 2022, vol. 30, no. 2, p. 135-147. ISSN: 1561-4042. Detail

Back to top