The k-distinct language: parameterized automata constructions

DOI10.1007/978-3-319-13524-3_8MaRDI QIDQ2946010zbMATH OpenOpenAlexFDO

Authors Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi

Publication date 15 September 2015

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13524-3_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• The \(k\)-distinct language: parameterized automata constructions
• Narrow sieves for parameterized paths and packings
• Faster deterministic parameterized algorithm for \(k\)-path
• A multi-parameter analysis of hard problems on deterministic finite automata
• scientific article; zbMATH DE number 2068873

Cited in

(4)

• The \(k\)-distinct language: parameterized automata constructions
• A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)
• Kleene theorems for free choice automata over distributed alphabets
• On the Kleijn-Rozenberg k-adjacent languages

This page was built for publication: The \(k\)-distinct language: parameterized automata constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946010)