Search results
- 1.0449858 - ÚI 2016 RIV SG eng J - Journal Article
van Leeuwen, J. - Wiedermann, Jiří
Separating the Classes of Recursively Enumerable Languages Based on Machine Size.
International Journal of Foundations of Computer Science. Roč. 26, č. 6 (2015), s. 677-695. ISSN 0129-0541. E-ISSN 1793-6373
R&D Projects: GA ČR GAP202/10/1333
Grant - others:GA ČR(CZ) GA15-04960S
Institutional support: RVO:67985807
Keywords : recursively enumerable languages * RE hierarchy * finite languages * machine size * descriptional complexity * Turing machines with advice
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.467, year: 2015
Permanent Link: http://hdl.handle.net/11104/0251272File Download Size Commentary Version Access a0449858.pdf 12 262.7 KB Publisher’s postprint require - 2.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 - 3.0369498 - MÚ 2012 RIV SG eng J - Journal Article
Jirásková, G. - Masopust, Tomáš
Complexity in union-free regular languages.
International Journal of Foundations of Computer Science. Roč. 22, č. 7 (2011), s. 1639-1653. ISSN 0129-0541. E-ISSN 1793-6373
Institutional research plan: CEZ:AV0Z10190503
Keywords : Union-free regular language * one-cycle-free-path automaton * descriptional complexity
Subject RIV: BA - General Mathematics
Impact factor: 0.379, year: 2011
http://www.worldscinet.com/ijfcs/22/2207/S0129054111008933.html
Permanent Link: http://hdl.handle.net/11104/0203547File Download Size Commentary Version Access Masopust.pdf 2 404.2 KB 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 - 5.0346740 - MÚ 2011 RIV NL eng J - Journal Article
Goldefus, F. - Masopust, Tomáš - Meduna, A.
Left-forbidding cooperating distributed grammar systems.
Theoretical Computer Science. Roč. 411, 40-42 (2010), s. 3661-3667. ISSN 0304-3975. E-ISSN 1879-2294
Institutional research plan: CEZ:AV0Z10190503
Keywords : cooperating distributed grammar system * cooperating derivation mode * left-forbidding grammar * generative power * descriptional complexity
Subject RIV: BA - General Mathematics
Impact factor: 0.838, year: 2010
http://www.sciencedirect.com/science/article/pii/S0304397510003440
Permanent Link: http://hdl.handle.net/11104/0187681File Download Size Commentary Version Access Masopust1.pdf 2 301.3 KB Publisher’s postprint require - 6.0346729 - MÚ 2011 RIV DE eng C - Conference Paper (international conference)
Jirásková, G. - Masopust, Tomáš
Complexity in Union-Free Regular Languages.
Developments in Language Theory. Berlin: Springer, 2010 - (Gao, Y.; Lu, H.; Seki, S.), s. 255-266. Lecture Notes in Computer Science, 6224. ISBN 978-3-642-14455-4.
[DLT2010. 14th International Conference on Developments in Language Theory. London (CA), 17.08.2010-20.08.2010]
Institutional research plan: CEZ:AV0Z10190503
Keywords : descriptional complexity * union-free regular language * one-cycle-free-path finite automaton
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-14455-4_24
Permanent Link: http://hdl.handle.net/11104/0187671File Download Size Commentary Version Access Masopust2.pdf 1 242.6 KB Publisher’s postprint require - 7.0345656 - MÚ 2011 RIV NL eng J - Journal Article
Masopust, Tomáš
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals.
Fundamenta Informaticae. Roč. 99, č. 4 (2010), s. 473-480. ISSN 0169-2968. E-ISSN 1875-8681
Institutional research plan: CEZ:AV0Z10190503
Keywords : Scattered context grammars * parallel productions * descriptional complexity * generative power
Subject RIV: BA - General Mathematics
Impact factor: 0.522, year: 2010
http://iospress.metapress.com/content/f883562g5j612614/?issue=4&genre=article&spage=473&issn=0169-2968&volume=99
Permanent Link: http://hdl.handle.net/11104/0186871File Download Size Commentary Version Access Masopust4.pdf 1 71 KB Publisher’s postprint require