%0 Conference Paper %1 conf/icgi/CosteN98 %A Coste, François %A Nicolas, Jacques %B ICGI %D 1998 %E Honavar, Vasant G. %E Slutzki, Giora %I Springer %K dblp %P 199-210 %T How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree. %U http://dblp.uni-trier.de/db/conf/icgi/icgi1998.html#CosteN98 %V 1433 %@ 3-540-64776-7

@inproceedings{conf/icgi/CosteN98, added-at = {2017-05-17T00:00:00.000+0200}, author = {Coste, François and Nicolas, Jacques}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/25a49a02a5a4d5123f5d91bb18dc25f55/dblp}, booktitle = {ICGI}, crossref = {conf/icgi/1998}, editor = {Honavar, Vasant G. and Slutzki, Giora}, ee = {https://doi.org/10.1007/BFb0054076}, interhash = {5b0436d1c47977b4fc9a73c25ec6c2a0}, intrahash = {5a49a02a5a4d5123f5d91bb18dc25f55}, isbn = {3-540-64776-7}, keywords = {dblp}, pages = {199-210}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T13:58:11.000+0200}, title = {How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree.}, url = {http://dblp.uni-trier.de/db/conf/icgi/icgi1998.html#CosteN98}, volume = 1433, year = 1998 }