Results 1  10
of
88
OneUnambiguous Regular Languages
 Information and computation
, 1997
"... The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic metalanguage for the definition of textual markup systems. In the standard, the righthand sides of productions are based on regular expressions, although only regular expressions that denote words unambigu ..."
Abstract

Cited by 131 (9 self)
 Add to MetaCart
The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic metalanguage for the definition of textual markup systems. In the standard, the righthand sides of productions are based on regular expressions, although only regular expressions that denote words unambiguously, in the sense of the ISO standard, are allowed. In general, a word that is denoted by a regular expression is witnessed by a sequence of occurrences of symbols in the regular expression that match the word. In an unambiguous regular expression as defined by Book, Even, Greibach, and Ott, each word has at most one witness. But the SGML standard also requires that a witness be computed incrementally from the word with a onesymbol lookahead; we call such regular expressions 1unambiguous. A regular language is a 1unambiguous language if it is denoted by some 1unambiguous regular expression. We give a Kleene theorem for 1unambiguous languages and characterize 1unambiguous regu...
Regular Expressions into Finite Automata
 Theoretical Computer Science
, 1996
"... It is a wellestablished fact that each regular expression can be transformed into a nondeterministic finite automaton (NFA) with or without ffltransitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi [BS86] have shown that the construction of ..."
Abstract

Cited by 84 (5 self)
 Add to MetaCart
It is a wellestablished fact that each regular expression can be transformed into a nondeterministic finite automaton (NFA) with or without ffltransitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi [BS86] have shown that the construction of an fflfree NFA due to to Glushkov [Glu61] is a natural representation of the regular expression, because it can be described in terms of the Brzozowski derivatives [Brz64] of the expression. Moreover, the Glushkov construction also plays a significant role in the document processing area: The SGML standard [ISO86], now widely adopted by publishing houses and government agencies for the syntactic specification of textual markup systems, uses deterministic regular expressions, i.e. expressions whose Glushkov automaton is deterministic, as a description language for document types. In this paper, we first show that the Glushkov automaton can be constructed in time quadratic in the size of the...
State Complexity of Basic Operations on Finite Languages
"... The state complexity of basic operations on regular languages has been studied in [911]. Here we focus on finite languages. We show that the catenation of two finite languages accepted by an m state and an nstate DFA, respectively, with m ? n is accepted by a DFA of (m \Gamma n + 3)2 n\Gamma2 ..."
Abstract

Cited by 48 (12 self)
 Add to MetaCart
The state complexity of basic operations on regular languages has been studied in [911]. Here we focus on finite languages. We show that the catenation of two finite languages accepted by an m state and an nstate DFA, respectively, with m ? n is accepted by a DFA of (m \Gamma n + 3)2 n\Gamma2 \Gamma 1 states in the twoletter alphabet case, and this bound is shown to be reachable. We also show that the tight upperbounds for the number of states of a DFA that accepts the star of an nstate finite language is 2 n\Gamma3 + 2 n\Gamma4 in the twoletter alphabet case. The same bound for reversal is 3 \Delta 2 p\Gamma1 \Gamma 1 when n is even and 2 p \Gamma 1 when n is odd. Results for alphabets of an arbitrary size are also obtained. These upperbounds for finite languages are strictly lower than the corresponding ones for general regular languages.
State complexity of basic operations on suffixfree regular languages
, 2007
"... We investigate the state complexity of basic operations for suffixfree regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worstcase for the minimal deterministic finitestate automaton that accepts the lan ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
(Show Context)
We investigate the state complexity of basic operations for suffixfree regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worstcase for the minimal deterministic finitestate automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffixfree regular languages.
Normal Form Algorithms for Extended ContextFree Grammars
 Theoretical Computer Science
, 2000
"... We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will p ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
(Show Context)
We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will provide a C++ toolkit for the symbolic manipulation of contextfree objects just as Grail does for regular objects. Our results generalize known complexity bounds for contextfree grammars but do so in nontrivial ways. Specifically, we introduce a new representation scheme for extended contextfree grammars (the symbolthreaded expression forest), a new normal form for these grammars (dot normal form) and new regular expression algorithms. 1 Introduction In the 1960's, extended contextfree grammars were introduced, based on BackusNaur form, as a useful abbreviatory notation that made contextfree grammars easier to write. More recently, the Standardized General Markup Language (SGML...
Standard Generalized Markup Language: Mathematical and Philosophical Issues
 Computer Science Today. Recent Trends and Developments
, 1995
"... . The Standard Generalized Markup Language (SGML), an ISO standard, has become the accepted method of defining markup conventions for text files. SGML is a metalanguage for defining grammars for textual markup in much the same way that BackusNaur Form is a metalanguage for defining programming ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
. The Standard Generalized Markup Language (SGML), an ISO standard, has become the accepted method of defining markup conventions for text files. SGML is a metalanguage for defining grammars for textual markup in much the same way that BackusNaur Form is a metalanguage for defining programminglanguage grammars. Indeed, HTML, the method of marking up a hypertext documents for the World Wide Web, is an SGML grammar. The underlying assumptions of the SGML initiative are that a logical structure of a document can be identified and that it can be indicated by the insertion of labeled matching brackets (start and end tags). Moreover, it is assumed that the nesting relationships of these tags can be described with an extended contextfree grammar (the righthand sides of productions are regular expressions). In this survey of some of the issues raised by the SGML initiative, I reexamine the underlying assumptions and address some of the theoretical questions that SGML raises....
Rita  an Editor and User Interface for Manipulating Structured Documents
, 1991
"... This paper describes Rita, its user interface and some of its internal structure and algorithms, and relates anecdotal user experiences. Comparisons are also made with other commercial and experimental systems. ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
This paper describes Rita, its user interface and some of its internal structure and algorithms, and relates anecdotal user experiences. Comparisons are also made with other commercial and experimental systems.
Obtaining shorter regular expressions from finitestate automata
 Theoretical Computer Science
, 2007
"... Abstract. We consider the use of state elimination to construct shorter regular expressions from finitestate automata. Although state elimination is an intuitive method for computing regular expressions from finitestate automata, the resulting regular expressions are often very long and complicated ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We consider the use of state elimination to construct shorter regular expressions from finitestate automata. Although state elimination is an intuitive method for computing regular expressions from finitestate automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finitestate automata to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given finitestate automata. We prove that we should not eliminate bridge states until we eliminate all nonbridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that lead to shorter regular expressions based on vertical chopping and horizontal chopping. Note that we have omitted almost all proofs in this preliminary version. 1
On The Composition Of Security Properties
, 1996
"... This thesis presents a general theory of system composition for possibilistic security properties. It is shown that possibilistic security properties can be viewed as a predicate over the traces that are consistent with a low level observation t low . We provide a uniform framework for analyzing and ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
This thesis presents a general theory of system composition for possibilistic security properties. It is shown that possibilistic security properties can be viewed as a predicate over the traces that are consistent with a low level observation t low . We provide a uniform framework for analyzing and comparing these properties. We demonstrate how to determine what security property a system satisfies given the security properties satisfied by its constituent components. Also, we show how to construct a system that satisfies a desired security property. This analysis yields a condition that can be used to determine how a property may emerge under composition. We examine the reasons for the failure of feedback composition and provide necessary and sufficient conditions for determining when feedback composition will fail for all properties based on Generalized Noninterference. Unwinding theorems are given for a large class of security properties.
State complexity of prefixfree regular languages
 IN: PROCEEDINGS OF DCFS’06
, 2006
"... We investigate the state complexities of basic operations for prefixfree regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worstcase for the minimal deterministic finitestate automaton (DFA) that accepts ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
(Show Context)
We investigate the state complexities of basic operations for prefixfree regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worstcase for the minimal deterministic finitestate automaton (DFA) that accepts the language obtained from the operation. We know that a regular language is prefixfree if and only if its minimal DFA has only one final state and the final state has no outtransitions whose target state is not a sink state. Based on this observation, we reduce the state complexities for prefixfree regular languages compared with the state complexities for (general) regular languages. For both catenation and Kleene star operations of (general) regular languages, the state complexities are exponential in the size of given minimal DFAs. On the other hand, if both regular languages are prefixfree, then the state complexities are at most linear. We also demonstrate that we can reduce the state complexities of intersection and union operations based on the structural properties of prefixfree minimal DFAs.