Efficient evaluation of nondeterministic automata using factorization forests

DOI10.1007/978-3-642-14165-2_44zbMATH Open1288.68147OpenAlexW1534826865MaRDI QIDQ3587404FDOQ3587404

Authors: Mikołaj Bojańczyk, Paweł Parys 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_44

Recommendations

• scientific article; zbMATH DE number 1953131
• Reduction of nondeterministic tree automata
• Succinct representation for (non)deterministic finite automata
• scientific article; zbMATH DE number 1419219
• Evaluating linear XPath expressions by pattern-matching automata

Mathematics Subject Classification ID

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

Cited In (6)

• The factorisation forest theorem
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• Oblivious DFA evaluation on joint input and its applications
• Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Efficient evaluation of nondeterministic automata using factorization forests

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