{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:32:37Z","timestamp":1777645957500,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p>We introduce (finite and infinite) typical paths of a graph and prove that the typical paths carry all information with probability 1, asymptotically. An automata-theoretic characterization of the typical paths is shown: finite typical paths can be accepted by reversal-bounded multicounter automata and infinite typical paths can be accepted by counting B\u00fcchi automata (a generalization of reversal-bounded multicounter automata running on \u03c9-words). We take a statechart example to show how to generate typical paths from a graph using SPIN model checker. The results are useful in automata theory since one can identify an information-concentrated-core of a regular language such that only words in the information-concentrated-core carry nontrivial information. When the graph is used to specify the system under test, the results are also useful in software testing by providing an information-theoretic approach to select test cases that carry nontrivial information of the system specification.<\/jats:p>","DOI":"10.3233\/fi-2011-530","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:44:02Z","timestamp":1575330242000},"page":"95-109","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Typical Paths of a Graph"],"prefix":"10.1177","volume":"110","author":[{"given":"Cewei","family":"Cui","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164, USA. ccui@eecs.wsu.edu; zdang@eecs.wsu.edu; fischer@eecs.wsu.edu"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164, USA. ccui@eecs.wsu.edu; zdang@eecs.wsu.edu; fischer@eecs.wsu.edu"}]},{"given":"Thomas R.","family":"Fischer","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164, USA. ccui@eecs.wsu.edu; zdang@eecs.wsu.edu; fischer@eecs.wsu.edu"}]}],"member":"179","published-online":{"date-parts":[[2011,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-530","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:53Z","timestamp":1777444433000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":0,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.3233\/FI-2011-530"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-530","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}