Search for Author All Reviews
	Tan, Tony     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       Graph reachability and pebble automata over infinite alphabets Tan T. ACM Transactions on Computational Logic 14(3): 1-31, 2013.  Type: Article It is known that a sentence of first-order logic of quantifier rank k can only express reachability in a directed graph of diameter at most 2k. Thus, general directed graph reachability ...... Nov 7 2013
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy