Efficient Evaluation of Nondeterministic Automata Using Factorization Forests

DOI10.1007/978-3-642-14165-2_44zbMath1288.68147OpenAlexW1534826865MaRDI QIDQ3587404

Paweł Parys, Mikołaj Bojańczyk

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

Mathematics Subject Classification ID

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

Related Items (1)

The factorisation forest theorem

This page was built for publication: Efficient Evaluation of Nondeterministic Automata Using Factorization Forests