Number of the records: 1
Complexity in Union-Free Regular Languages
- 1.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
Number of the records: 1