Regular binoid expressions and regular binoid languages
نویسندگان
چکیده
منابع مشابه
Simple-Regular Expressions and Languages
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute simple-regular languages from finite-state automata. Furthermore, we investigate the complexity blowup from a given finite-state automaton to its simple-regular language automaton and show that there is an exponential blow...
متن کاملOn the Regularity of Binoid Languages: A Comparative Approach
A binoid is a set with two associative operations where the operations share a common identity element, while subsets of free binoids are called binoid languages. Two independent studies concerning the regularity of binoid languages were done by Hashiguchi et al. who used term representations and monoid automata and by Ésik and Németh who employed parenthesizing automata for the acceptance of b...
متن کاملParameterized Regular Expressions and Their Languages
We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainty semantics, the word must be denoted by every such ...
متن کاملEnumerating Regular Expressions and Their Languages
In this chapter we discuss the problem of enumerating distinct regular expressions bysize and the regular languages they represent. We discuss various notions of the size of a regularexpression that appear in the literature and their advantages and disadvantages. We consider aformal definition of regular expressions using a context-free grammar.We then show how to enumerate stri...
متن کاملRegular Expressions for Languages over Infinite Alphabets
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is acceptable by finite-state unification based automaton – a model of computation that is tightly related to other models of automata over infinite alphabets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00137-3