The Parameterized Complexity of Chosen Problems for Finite Automata on Trees

DOI10.1007/978-3-642-21254-3_9zbMath1330.68141OpenAlexW140589640MaRDI QIDQ3004573

Agata Barecka, Witold Charatonik

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Parameterized complexity of basic decision problems for tree automata

This page was built for publication: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees