
doc. Mgr. Michal Kunc, Ph.D.
docent – Ústav matematiky a statistiky
kancelář: pav. 08/02014b
Kotlářská 267/2
611 37 Brno
telefon: | 549 49 4839 |
---|---|
e‑mail: | kunc@math.muni.cz |
sociální a akademické sítě: |
---|
Počet publikací: 28
2021
-
Language equations
Handbook of Automata Theory: Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications, rok: 2021, počet stran: 35 s.
2020
-
Reversibility of computations in graph-walking automata
Information and computation, rok: 2020, ročník: 275, vydání: December 2020, DOI
2019
-
The generalized rank of trace languages
International Journal of Foundations of Computer Science, rok: 2019, ročník: 30, vydání: 1, DOI
2018
-
The omega-inequality problem for concatenation hierarchies of star-free languages
Forum Mathematicum, rok: 2018, ročník: 30, vydání: 3, DOI
2017
-
The generalized rank of trace languages
Developments in Language Theory. 21st International Conference, DLT 2017, Liege, Belgium, August 7-11, 2017, Proceedings, rok: 2017
2015
-
On decidability of intermediate levels of concatenation hierarchies
Developments in Language Theory : 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings, rok: 2015
2013
-
Reversibility of computations in graph-walking automata
Mathematical Foundations of Computer Science 2013, rok: 2013
2012
-
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science, rok: 2012, ročník: 449, vydání: 1, DOI
2011
-
Describing periodicity in two-way deterministic finite automata using transformation semigroups
Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings, rok: 2011
-
State complexity of operations on two-way deterministic finite automata over a unary alphabet
Descriptional Complexity of Formal Systems: 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings, rok: 2011