@inproceedings{10.1007/978-3-642-14684-8_9,
    Abstract = {We consider the problem of reducing the number of states of nondeterministic finite automata, and show how to encode the reduction as a Boolean satisfiability problem. This approach improves on previous work by reducing a more general class of automata. Experimental results show that it produces a minimal automaton in almost all cases and that the running time compares favourably to the Kameda-Weiner algorithm.},
    Address = {Berlin, Heidelberg},
    Author = {Geldenhuys, Jaco and van der Merwe, Brink and van Zijl, Lynette},
    BookTitle = {Finite-State Methods and Natural Language Processing},
    Editor = {Yli-Jyr{\"a}, Anssi and Kornai, Andr{\'a}s and Sakarovitch, Jacques and Watson, Bruce},
    File = {Reducing Nondeterministic Finite Automata with SAT Solvers - Geldenhuys2010\_Chapter\_ReducingNondeterministicFinite - z.pdf},
    ISBN = {978-3-642-14684-8},
    Pages = {81--92},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Reducing Nondeterministic Finite Automata with SAT Solvers},
    Year = {2010},
    date-added = {2021-03-09 17:05:39 +0100},
    date-modified = {2021-03-09 17:05:39 +0100},
    doi = {10.1007/978-3-642-14684-8_9}
}

@inproceedings{10.1007/978-3-642-14684-8_9, Abstract = {We consider the problem of reducing the number of states of nondeterministic finite automata, and show how to encode the reduction as a Boolean satisfiability problem. This approach improves on previous work by reducing a more general class of automata. Experimental results show that it produces a minimal automaton in almost all cases and that the running time compares favourably to the Kameda-Weiner algorithm.}, Address = {Berlin, Heidelberg}, Author = {Geldenhuys, Jaco and van der Merwe, Brink and van Zijl, Lynette}, BookTitle = {Finite-State Methods and Natural Language Processing}, Editor = {Yli-Jyr{\"a}, Anssi and Kornai, Andr{\'a}s and Sakarovitch, Jacques and Watson, Bruce}, File = {Reducing Nondeterministic Finite Automata with SAT Solvers - Geldenhuys2010_Chapter_ReducingNondeterministicFinite - z.pdf}, ISBN = {978-3-642-14684-8}, Pages = {81--92}, Publisher = {Springer Berlin Heidelberg}, Title = {Reducing Nondeterministic Finite Automata with SAT Solvers}, Year = {2010}, date-added = {2021-03-09 17:05:39 +0100}, date-modified = {2021-03-09 17:05:39 +0100}, doi = {10.1007/978-3-642-14684-8_9} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge