{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:49:43Z","timestamp":1725558583993},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410119"},{"type":"electronic","value":"9783540452577"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-45257-7_3","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T22:05:01Z","timestamp":1278021901000},"page":"25-38","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Ambiguity Detection in C-NFA"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Coste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Fredouille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Alqu\u00e9zar, R.: Symbolic and connectionist learning techniques for grammatical inference. Th\u00e8se de PhD, Universitat Politecnica de Catalunya (Mars 1997)"},{"key":"3_CR2","unstructured":"Alqu\u00e9zar, R., Sanfeliu, A.: Incremental grammatical inference from positive and negative data using unbiased finite state automata. In: Shape, Structure and Pattern Recognition. Proc. Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR 1994, Nahariya, Israel, pp. 291\u2013300 (1995)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"C 21","author":"A.W. Biermann","year":"1972","unstructured":"Biermann, A.W., Feldmann, J.A.: On the synthesis of finite-state machines from samples of their behaviour. IEEE Transactions on Computeurs\u00a0C 21, 592\u2013597 (1972)","journal-title":"IEEE Transactions on Computeurs"},{"key":"3_CR4","unstructured":"Coste, F., Nicolas, J.: Regular inference as a graph coloring problem. In: Workshop on Grammar Inference, Automata Induction, and Language Acquisition (ICML 1997), Nashville, TN, USA (juillet 1997)"},{"key":"3_CR5","unstructured":"Coste, F.: State merging inference of finite state classifiers. Rapport technique No INRIA\/RR-3695, IRISA (Septembre 1999)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera de la","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning\u00a027, 125\u2013138 (1997)","journal-title":"Machine Learning"},{"key":"3_CR7","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Apprentissage de langages r\u00e9guliers \u00e0 l\u2019aide d\u2019automates non d\u00e9t\u00e9rministes. In: Conf\u00e9rence d\u2019apprentissage CAp 2000 (2000)"},{"key":"3_CR8","unstructured":"Dupont, P.: Utilisation et apprentissage de mod\u00e8les de langages pour la reconnaissance de la parole continue. Th\u00e8se de PhD, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications (1996)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037, 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"3_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1980","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, N. Reading (1980)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lang, K.J.: Random dfa\u2019s can be approximately learned from sparse uniform examples. In: 5th ACM workshop on Computation Learning Theorie, pp. 45\u201352 (1992)","DOI":"10.1145\/130385.130390"},{"key":"3_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K.J. Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis, 49\u201361 (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"3_CR14","unstructured":"Oliveira, A.L., Silva, J.P.M.: Efficient search techniques for the inference of minimum size finite automata. In: South American Symposium on String Processing and Information Retrieval (1998)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Automata Implementation","author":"K. Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: Nfa to dfa transformation for finite languages. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, Springer, Heidelberg (1997)"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1093\/oso\/9780198538509.003.0007","volume":"13","author":"T. Yokomori","year":"1994","unstructured":"Yokomori, T.: Learning non-deterministic finite automata from queries and counterexamples. Machine Intelligence\u00a013, 169\u2013189 (1994)","journal-title":"Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45257-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T23:07:47Z","timestamp":1711580867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45257-7_3"}},"subtitle":["A Step Towards the Inference of Non Deterministic Automata"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410119","9783540452577"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45257-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}