{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:12Z","timestamp":1725493452947},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_19","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"192-202","source":"Crossref","is-referenced-by-count":2,"title":["A Measure for the Degree of Nondeterminism of Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Franti\u0161ek","family":"Mr\u00e1z","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pl\u00e1tek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Kubo\u0148, V., Pl\u00e1tek, M.: A grammar based approach to a grammar checking of free word order languages. In: COLING 1994. 15th International Conference on Computational Linguistics, Kyoto, Japan, vol.\u00a0II, pp. 906\u2013910 (1994)","DOI":"10.3115\/991250.991294"},{"key":"19_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/11551874_18","volume-title":"Text, Speech and Dialogue","author":"M. Lopatkov\u00e1","year":"2005","unstructured":"Lopatkov\u00e1, M., Pl\u00e1tek, M., Kubo\u0148, V.: Modeling syntax of free word-order languages: Dependency analysis by reduction. In: Matou\u0161ek, V., Mautner, P., Pavelka, T. (eds.) TSD 2005. LNCS (LNAI), vol.\u00a03658, pp. 140\u2013147. Springer, Heidelberg (2005)"},{"key":"19_CR3","unstructured":"Lopatkov\u00e1, M., Pl\u00e1tek, M., Sgall, P.: Functional generative description, restarting automata and analysis by reduction. In: Abstracts of Formal Description of Slavic Languages Conference 6.5 (2006)"},{"key":"19_CR4","first-page":"287","volume":"4","author":"P. Jan\u010dar","year":"1999","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: On monotonic automata with a restart operation. Journal of Automata, Languages and Combinatorics\u00a04, 287\u2013311 (1999)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"19_CR5","unstructured":"Bordihn, H., Dassow, J.: A note on the degree of nondeterminism. In: Developments in Language Theory, pp. 70\u201380 (1993)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J. Goldstine","year":"1990","unstructured":"Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Information and Computation\u00a086, 179\u2013194 (1990)","journal-title":"Information and Computation"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BFb0023467","volume-title":"STACS 97","author":"J. Goldstine","year":"1997","unstructured":"Goldstine, J., Leung, H., Wotschke, D.: Measuring nondeterminism in pushdown automata. Journal of Computer and System Sciences 71, 440\u2013466 (2005). An extended abstract appeared In: Reischuk, R., Morvan, M. (eds.) STACS 97. LNCS, vol.\u00a01200, pp. 295\u2013306. Springer, Heidelberg (1997)"},{"key":"19_CR8","first-page":"154","volume-title":"Developments in Language Theory II, Proc.","author":"K. Salomaa","year":"1996","unstructured":"Salomaa, K., Yu, S.: Nondeterminism degrees for context-free languages. In: Dassow, J., Rosenberg, G., Salomaa, A. (eds.) Developments in Language Theory II, Proc., pp. 154\u2013165. World Scientific, Singapore (1996)"},{"key":"19_CR9","series-title":"Studies in Computational Intelligence","first-page":"269","volume-title":"Recent Advances in Formal Languages and Applications","author":"F. Otto","year":"2006","unstructured":"Otto, F.: Restarting automata. In: \u00c9sik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol.\u00a025, pp. 269\u2013303. Springer, Berlin (2006)"},{"key":"19_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, Reading (1980)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:07Z","timestamp":1619520487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_19","relation":{},"subject":[]}}