oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Complexity of countable categoricity in finite languages  [PDF]
A. Ivanov
Mathematics , 2011,
Abstract: We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
Existential Rule Languages with Finite Chase: Complexity and Expressiveness  [PDF]
Heng Zhang,Yan Zhang,Jia-Huai You
Computer Science , 2014,
Abstract: Finite chase, or alternatively chase termination, is an important condition to ensure the decidability of existential rule languages. In the past few years, a number of rule languages with finite chase have been studied. In this work, we propose a novel approach for classifying the rule languages with finite chase. Using this approach, a family of decidable rule languages, which extend the existing languages with the finite chase property, are naturally defined. We then study the complexity of these languages. Although all of them are tractable for data complexity, we show that their combined complexity can be arbitrarily high. Furthermore, we prove that all the rule languages with finite chase that extend the weakly acyclic language are of the same expressiveness as the weakly acyclic one, while rule languages with higher combined complexity are in general more succinct than those with lower combined complexity.
Incomplete Transition Complexity of Basic Operations on Finite Languages  [PDF]
Eva Maia,Nelma Moreira,Rogério Reis
Computer Science , 2013,
Abstract: The state complexity of basic operations on finite languages (considering complete DFAs) has been in studied the literature. In this paper we study the incomplete (deterministic) state and transition complexity on finite languages of boolean operations, concatenation, star, and reversal. For all operations we give tight upper bounds for both description measures. We correct the published state complexity of concatenation for complete DFAs and provide a tight upper bound for the case when the right automaton is larger than the left one. For all binary operations the tightness is proved using family languages with a variable alphabet size. In general the operational complexities depend not only on the complexities of the operands but also on other refined measures.
Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages  [PDF]
Janusz Brzozowski,David Liu
Computer Science , 2012,
Abstract: We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a function of the state complexity n of the languages. We prove that (n-1)! is a tight upper bound for finite/cofinite languages and that it can be reached only if the alphabet size is greater than or equal to (n-1)!-(n-2)!. We prove that the bound is also (n-1)! for reverse definite languages, but the minimal alphabet size is (n-1)!-2(n-2)!. We show that \lfloor e\cdot (n-1)!\rfloor is a lower bound on the syntactic complexity of definite languages, and conjecture that this is also an upper bound, and that the alphabet size required to meet this bound is \floor{e \cdot (n-1)!} - \floor{e \cdot (n-2)!}. We prove the conjecture for n\le 4.
Easily Adaptable Complexity Measure for Finite Time Series  [PDF]
Da-Guan Ke,Qin-Ye Tong
Physics , 2005,
Abstract: We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the widely accepted but conflicting criteria for complexity measurements. Surprisingly, the measure is developed from Kolmogorov complexity, which is traditionally believed to represent only randomness and to satisfy one criterion to the exclusion of the others. For familiar iterative systems, our treatment may imply a heuristic approach to transforming symbolic dynamics into permutation dynamics and vice versa.
On the Complexity of Flanked Finite State Automata  [PDF]
Florent Avellaneda,Silvano Dal Zilio,Jean-Baptiste Raclet
Computer Science , 2015,
Abstract: We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity properties while preserving the succinctness of nondeterministic automata. In particular, we show that the universality problem for FFA is in linear time and that language inclusion can be checked in polynomial time. A useful application of FFA is to provide an efficient way to compute the quotient and inclusion of regular languages without the need to use the powerset construction. These operations are the building blocks of several verification algorithms.
Syntactic Complexity of Star-Free Languages  [PDF]
Janusz Brzozowski,Baiyu Li
Computer Science , 2011,
Abstract: The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function of the state complexity of these languages. We study the syntactic complexity of star-free regular languages, that is, languages that can be constructed from finite languages using union, complement and concatenation. We find tight upper bounds on the syntactic complexity of languages accepted by monotonic and partially monotonic automata. We introduce "nearly monotonic" automata, which accept star-free languages, and find a tight upper bound on the syntactic complexity of languages accepted by such automata. We conjecture that this bound is also an upper bound on the syntactic complexity of star-free languages.
Quotient Complexity of Star-Free Languages  [PDF]
Janusz Brzozowski,Bo Liu
Computer Science , 2010,
Abstract: The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite languages and closed under boolean operations and concatenation. We prove that the tight bounds on the quotient complexities of union, intersection, difference, symmetric difference, concatenation, and star for star-free languages are the same as those for regular languages, with some small exceptions, whereas the bound for reversal is 2^n-1.
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis  [PDF]
Peter Jonsson,Victor Lagerkvist,Johannes Schmidt,Hannes Uppman
Computer Science , 2014,
Abstract: Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT($\cdot$) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation $R$ such that SAT($R$) can be solved at least as fast as any other NP-hard SAT($\cdot$) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (MaxOnes($\Gamma$)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages (VCSP($\Delta$)). With the help of these languages we relate MaxOnes and VCSP to the exponential time hypothesis in several different ways.
Parikh Images of Regular Languages: Complexity and Applications  [PDF]
Anthony Widjaja To
Computer Science , 2010,
Abstract: We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and total size 2^{O(k^2 log n)}, i.e., polynomial for all fixed k >= 1. Previously, it was not known whether the number of generators could be made independent of n, and best upper bounds on the total size were exponential in n. Furthermore, we give an algorithm for performing such a translation in time 2^{O(k^2 log(kn))}. Our proof exploits a previously unknown connection to the theory of convex sets, and establishes a normal form theorem for semilinear sets, which is of independent interests. To complement these results, we show that our upper bounds are tight and that the results cannot be extended to context-free languages. We give four applications: (1) a new polynomial fragment of integer programming, (2) precise complexity of membership for Parikh images of NFAs, (3) an answer to an open question about polynomial PAC-learnability of semilinear sets, and (4) an optimal algorithm for LTL model checking over discrete-timed reversal-bounded counter systems.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.