Search results
- 1.0476164 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
de Oliveira Oliveira, Mateus
Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth.
11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Guo, J.; Hermelin, D.), s. 1-12, č. článku 25. Leibniz International Proceedings in Informatics, 63. ISBN 978-3-95977-023-1. ISSN 1868-8969.
[11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Aarhus (DK), 24.08.2016-26.08.2016]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : linear term rewriting systems * ground reachability * ground joinability * fixed parameter tractability
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://drops.dagstuhl.de/opus/volltexte/2017/6925/
Permanent Link: http://hdl.handle.net/11104/0272695File Download Size Commentary Version Access DeOliveiraOliveira1.pdf 3 669.5 KB Publisher’s postprint require - 2.0435915 - ÚI 2016 RIV US eng J - Journal Article
Chvalovský, Karel
Undecidability of Consequence Relation in Full Non-associative Lambek Calculus.
Journal of Symbolic Logic. Roč. 80, č. 2 (2015), s. 567-586. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA ČR GAP202/10/1826
Institutional support: RVO:67985807
Keywords : substructural logics * consequence relation * undecidability * tag systems * word problem * rewriting systems
Subject RIV: BA - General Mathematics
Impact factor: 0.510, year: 2015
Permanent Link: http://hdl.handle.net/11104/0239734File Download Size Commentary Version Access a0435915.pdf 5 373.1 KB Publisher’s postprint require 0435915.pdf 2 1 MB Author´s preprint require - 3.0431686 - ÚI 2015 AT eng A - Abstract
Chvalovský, Karel
Undecidability of consequence relation in Full Non-associative Lambek Calculus.
Abstract Booklet - LATD 2014. Vienna: Vienna University of Technology, 2014 - (Baaz, M.; Ciabattoni, A.; Hetzl, S.). s. 153-154
[LATD 2014. Logic, Algebra and Truth Degrees. 16.07.2014-19.07.2014, Vienna]
R&D Projects: GA ČR GAP202/10/1826
Institutional support: RVO:67985807
Keywords : substructural logics * consequence relation * undecidability * tag systems * word problem * rewriting systems
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0236272File Download Size Commentary Version Access a0431686.pdf 0 308 KB Publisher’s postprint open-access - 4.0328399 - ÚI 2010 DE eng A - Abstract
Chvalovský, Karel
Derivational complexity of {aa-->bc, bb-->ac, cc-->ab}.
10th International Workshop on Termination WST 2009. Leipzig: HTWK, 2009 - (Geser, A.; Waldmann, J.). s. 28-30
[WST 2009. International Workshop on Termination /10./. 03.06.2009-05.06.2009, Leipzig]
R&D Projects: GA ČR GD401/09/H007
Institutional research plan: CEZ:AV0Z10300504
Keywords : rewriting systems * derivational complexity * upper bounds
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0174723 - 5.0328129 - ÚI 2010 CZ eng A - Abstract
Chvalovský, Karel
Derivational complexity of {aa-->bc, bb-->ac, cc-->ab}.
ISCAMI 2009. Ostrava: Universitas Ostraviensis, 2009. s. 29-29.
[ISCAMI 2009. 13.05.2009-15.05.2009, Malenovice]
Institutional research plan: CEZ:AV0Z10300504
Keywords : rewriting systems * derivational complexity * upper bounds
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0174520