Results 1  10
of
13
Automaticity III: Polynomial Automaticity And ContextFree Languages
 Computational Complexity
, 1996
"... . If L is a formal language, we define AL (n) to be the number of states in the smallest deterministic finite automaton that accepts a language that agrees with L on all inputs of length n. This measure is called automaticity. In this paper, we first study the closure properties of the class DPA of ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(languages of nondeterministic polylog automaticity). We conclude by showing how to construct a contextfree language of automaticity arbitrarily close to the maximum possible. Key words. automaticity, finite automata, nondeterminism Subject classifications. Primary 68Q68; Secondary 68Q75 68Q45. 1
Expressiveness and closure properties for quantitative languages
 In Proc. of LICS: Logic in Computer Science. IEEE Comp. Soc
, 2009
"... Abstract. Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit avera ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be nonωregular for deterministic limitaverage and discountedsum automata, while this set
Adding nesting structure to words
 In Developments in Language Theory, LNCS 4036
, 2006
"... We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linearhierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents. Neste ..."
Abstract

Cited by 119 (17 self)
 Add to MetaCart
. The linear encodings of nested words give the class of visibly pushdown languages of words, and this class lies between balanced languages and deterministic contextfree languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a contextfree language
M.: Finite Automata for the Sub and Superword Closure of CFLs: Descriptional and Computational Complexity (extended version). arXiv:1410.2737
"... Abstract. We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the statecomplexity of representing sub or superword closures of contextfree grammars (CFGs): (1) We prove a (tight) upper bound of 2O(n) on the size of nondeterministic finite automata (NFAs) representing the subword clo ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the statecomplexity of representing sub or superword closures of contextfree grammars (CFGs): (1) We prove a (tight) upper bound of 2O(n) on the size of nondeterministic finite automata (NFAs) representing the subword
Selfassembling finite automata
 IN PROCEEDINGS OF THE IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
, 2002
"... We investigate a model of selfassembling finite automata. An automaton is assembled on demand during its computation from copies out of a finite set of items. The items are pieces of a finite automaton which are connected to the already existing automaton by overlaying states. Depending on the al ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
on the allowed number of such interface states, the degree, innite hierarchies of properly included language families are shown. The presented model is a natural and unified generalization of regular and contextfree languages since degrees one and two are characterizing the finite and pushdown automata
Author manuscript, published in "ICDT (2012) 4660" Highly Expressive Query Languages for Unordered Data Trees ∗
, 2012
"... We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay ..."
Abstract
 Add to MetaCart
of different factors: the expressive power of basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic control. All languages are Turing complete, but not necessarily query complete in the sense of Chandra and Harel. Indeed, we show that some
Nondeterminism in CS highschool curricula
 Proceedings of the 33rd ASEE/IEEE Frontiers in Education Conference (FIE03
, 2003
"... Abstract One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a theoretical unit on computational models. It includes deterministic and nondeterministic finite automata, regular and nonregular languages, closure properties of regular languages, ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a theoretical unit on computational models. It includes deterministic and nondeterministic finite automata, regular and nonregular languages, closure properties of regular languages
The complexity of automatic complexity
, 2015
"... We define the automatic complexity A(E) of an equivalence relation E on a finite set S of strings. The minimum complexity is the number of equivalence classes E. We prove that the problem to determine whether A(E) = E  is NPcomplete, and the problem to determine whether A(E) = E  + k for a ..."
Abstract
 Add to MetaCart
fixed k ≥ 1 is complete for the second level of the Boolean hierarchy for NP, i.e., BH2complete. The definition of A(E) generalizes the notion of automatic complexity of individual strings due to Shallit and Wang. Let L be the language consisting of all strings of maximal nondeterministic auto
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
 Add to MetaCart
of concepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, properties, relations etc.) not completely but by means
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
 Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for discussions and advice. I would like to thank Arnaud Durand and Patrice Ossona de Mendez for accepting to review this thesis and for their constructive comments on the earlier versions of this manuscript. Many thanks to Nicole Bidoit and Victor Vianu for accepting to be in my jury. Special thanks go to my Parents, who directed me to follow the scientific path and where fully supportive at all times. Thanks to all the members of LSV – it was a pleasure working with You. I would like to thank the awesome people whom I have been working with in the same office on the 4th floor. Without all the nice riddles and the magnificent French lessons my time there wouldn’t be as chouette as it was. Big thanks go to my son Boris, who was kind enough to sleep through the whole nights, allowing his dad to actually write the thesis down.
Results 1  10
of
13