Search results
- 1.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 - 2.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