Search results
- 1.0394009 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Jirásková, G. - Masopust, Tomáš
On the state complexity of the reverse of R- and J-trivial regular languages.
Descriptional Complexity of Formal Systems 2013. Berlin: Springer, 2013 - (Jürgensen, H.; Reis, R.), s. 136-147. Lecture Notes in Computer Science, 8031. ISBN 978-3-642-39309-9.
[DCFS 2013. International Workshop on Descriptional Complexity of Formal Systems /15./. London (CA), 22.07.2013-25.07.2013]
R&D Projects: GA ČR(CZ) GPP202/11/P028
Institutional support: RVO:67985840
Keywords : state complexity * reverse * subregular languages
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007/978-3-642-39310-5_14
Permanent Link: http://hdl.handle.net/11104/0222338File Download Size Commentary Version Access Masopust1.pdf 2 228.7 KB Publisher’s postprint require - 2.0381247 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Jirásková, G. - Masopust, Tomáš
On properties and state complexity of deterministic state-partition automata.
Theoretical Computer Science. Berlin: Springer, 2012 - (Baeten, J.; Ball, T.; de Boer, F.), s. 164-178. Lecture Notes in Computer Science, 7604. ISBN 978-3-642-33474-0. ISSN 0302-9743.
[TCS 2012. IFIP TC 1/WG 2.2 International Conference /7./. Amsterdam (NL), 26.09.2012-28.09.2012]
R&D Projects: GA ČR(CZ) GPP202/11/P028
Institutional support: RVO:67985840
Keywords : deterministic finite automata * state partitioning * state complexity
Subject RIV: BA - General Mathematics
http://www.springerlink.com/content/tj427412271tm60w/
Permanent Link: http://hdl.handle.net/11104/0211764File Download Size Commentary Version Access Masopust3.pdf 1 323.7 KB Publisher’s postprint require - 3.0377957 - MÚ 2013 RIV NL eng J - Journal Article
Jirásková, G. - Masopust, Tomáš
On a structural property in the state complexity of projected regular languages.
Theoretical Computer Science. Roč. 449, Aug 31 (2012), s. 93-105. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR(CZ) GPP202/11/P028
Institutional research plan: CEZ:AV0Z10190503
Institutional support: RVO:67985840
Keywords : projections * state complexity * descriptional complexity
Subject RIV: BA - General Mathematics
Impact factor: 0.489, year: 2012
http://www.sciencedirect.com/science/article/pii/S0304397512003532
Permanent Link: http://hdl.handle.net/11104/0209965File Download Size Commentary Version Access Masopust2.pdf 1 1.1 MB Publisher’s postprint require - 4.0362730 - MÚ 2012 RIV DE eng C - Conference Paper (international conference)
Jirásková, G. - Masopust, Tomáš
State complexity of projected languages.
Descriptional Complexity of Formal Systems. Berlin: Springer, 2011 - (Holzer, M.; Kutrib, M.; Pighizzini, G.), s. 198-211. Lecture Notes in Computer Science, 6808. ISBN 978-3-642-22599-4.
[13th International workshop, DCFS 2011. Giessen/Limburg (DE), 25.07.2011-27.07.2011]
R&D Projects: GA ČR GPP202/11/P028
Grant - others:European Commission(XE) EU.ICT.DISC 224498
Institutional research plan: CEZ:AV0Z10190503
Keywords : descriptional complexity * state complexity * projection
Subject RIV: BA - General Mathematics
http://www.springerlink.com/content/h221760735tt7676/
Permanent Link: http://hdl.handle.net/11104/0198970File Download Size Commentary Version Access Masopust1.pdf 1 284.7 KB Publisher’s postprint require