Search w/in this Title for Titles All Reviews
	Acta Informatica Springer-Verlag New York, Inc.         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-10 of 133 reviews Date Reviewed     Symbolic checking of fuzzy CTL on fuzzy program graph Ebrahimi M., Sotudeh G., Movaghar A. Acta Informatica 56(1): 1-33, 2019.  Type: Article This paper presents a new temporal logic for fuzzy logic systems, fuzzy computation tree logic (FzCTL), based on previous work on Kripke structures for fuzzy logic systems, that is, fuzzy program graph (FzPG) [1]. The motivation for pr... Mar 20 2019   Sparsification and subexponential approximation Bonnet E., Paschos V. Acta Informatica 55(1): 1-15, 2018.  Type: Article A sparsification of a problem maps the problem to a set of similar problems, each of which has its parameters bounded by some fixed number. For example, in the case of a graph-based problem, the degree might be one parameter. The solut... Jun 14 2018   Metric temporal logic revisited Reynolds M. Acta Informatica 53(3): 301-324, 2016.  Type: Article The extension of temporal logic to measuring time durations is the basis of the theory of timed and hybrid automata, leading to the verification of metric temporal properties. Alur et al. (reference [1] in the paper), and more recently... Jun 3 2016   Deterministic ordered restarting automata for picture languages Otto F., Mráz F. Acta Informatica 52(7-8): 593-623, 2015.  Type: Article Languages of pictures (2D matrices with entries from a finite alphabet) have been studied since Blum and Hewitt [1]; Rosenfeld [2]; and Siromoney, Siromoney, and Krithivasan [3]. A nondeterministic notion of recognizability by tessella... Dec 30 2015   Richer interface automata with optimistic and pessimistic compatibility Lüttgen G., Vogler W., Fendrich S. Acta Informatica 52(4-5): 305-336, 2015.  Type: Article This paper considers the problems associated with the composition of modal interface automata. A modal interface automaton (MIA) has both must transitions, which specify that a transition lands in one of a finite number of states, and ... Aug 12 2015   A note on autodense related languages Fan C., Huang C., Shyr H., Chen K. Acta Informatica 47(4): 209-219, 2010.  Type: Article A formal language is autodense if any word can be modified by a prefix and a suffix to become a member. It is anti-autodense if adjoining a prefix and a suffix to a member always removes it from the language.... Oct 13 2010   On regular tree languages and deterministic pushdown automata Janoušek J., Melichar B. Acta Informatica 46(7): 533-547, 2009.  Type: Article Formal language theory abounds with fascinating relationships between context-free languages (CFLs) and the language-theoretic notion of regularity. For example, Parikh’s theorem maps a CFL to a regular language by ignoring t... Mar 17 2010   A general exhaustive generation algorithm for Gray structures Bernini A., Grazzini E., Pergola E., Pinzani R. Acta Informatica 44(5): 361-376, 2007.  Type: Article The starting point for this paper is the enumerating combinatorial objects (ECO) method. The ECO method is described as a set of succession rules that describe the formation of a rooted tree with labeled nodes. A typical set of rewriti... Mar 12 2008   Classifications of dense languages Li Z., Shyr H., Tsai Y. Acta Informatica 43(3): 173-194, 2006.  Type: Article What are dense languages? For a given alphabet X, the language L over this alphabet is said to be n-dense if, for any n nonempty words over X Nov 21 2007   Correctness of dataflow and systolic algorithms using algebras of streams Meinke K., Steggles L. Acta Informatica 38(1): 45-88, 2001.  Type: Article The authors use second-order equational (Horn) logic methods to verify various hardware algorithms; specifically, systolic algorithms and dataflow architectures. This is accomplished via two case studies.... Oct 16 2002       Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy