Results 1  10
of
22
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 66 (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...
The Validation of SGML Content Models
 MATHEMATICAL AND COMPUTER MODELLING
, 1997
"... The Standard Generalized Markup Language (SGML) is an ISO standard that provides a syntactic metalanguage for the definition of textual markup systems, which are used to indicate the structure of documents so that they can be electronically typeset, searched, and communicated. We address only on ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
The Standard Generalized Markup Language (SGML) is an ISO standard that provides a syntactic metalanguage for the definition of textual markup systems, which are used to indicate the structure of documents so that they can be electronically typeset, searched, and communicated. We address only one problem raised by the standard, namely: In SGML, the righthand sides of contextfree productions are regular expressions, called content models, that are restricted to be what the standard calls "unambiguous," but what is more appropriately called deterministic. We solve the problem of how to define determinism precisely, how to recognize deterministic regular expressions efficiently, and how to recognize deterministic regular languages. Any SGML parser must check that a given document grammar conforms to the standard; that is, it must validate it. Hence, our results are an important step in the clarification of the standard and in the efficient implementation of an SGML parser fo...
Assessing test data adequacy through program inference
 ACM Transactions on Programming Languages and Systems
, 1983
"... Despite the almost universal reliance on testing as the means of locating software errors and its long history of use, few criteria have been proposed for deciding when software has been thoroughly tested. As a basis for the development of usable notions of test data adequacy, an abstract definition ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Despite the almost universal reliance on testing as the means of locating software errors and its long history of use, few criteria have been proposed for deciding when software has been thoroughly tested. As a basis for the development of usable notions of test data adequacy, an abstract definition is proposed and examined, and approximations to this definition are considered.
Deterministic Regular Languages
 STACS 92
, 1991
"... The ISO standard for Standard Generalized Markup Language (SGML) provides a syntactic metalanguage for the definition of textual markup systems. In the standard the right hand sides of productions are called content models and they are based on regular expressions. The allowable regular express ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
The ISO standard for Standard Generalized Markup Language (SGML) provides a syntactic metalanguage for the definition of textual markup systems. In the standard the right hand sides of productions are called content models and they are based on regular expressions. The allowable regular expressions are those that are "unambiguous" as defined by the standard. Unfortunately, the standard's use of the term "unambiguous" does not correspond to the two well known notions, since not all regular languages are denoted by "unambiguous" expressions. Furthermore, the standard's definition of "unambiguous" is somewhat vague. Therefore, we provide a precise definition of "unambiguous expressions" and rename them deterministic regular expressions to avoid any confusion. A regular expression E is deterministic if the canonical fflfree finite automaton ME recognizing L(E) is deterministic. A regular language is deterministic if there is a deterministic expression that denotes it. We gi...
A Distributed Architecture for Executing Complex Tasks with Multiple Robots
 In: The IEEE International Conference on Robotics and Automation (ICRA2004), Apr 26May 1
, 2004
"... Abstract — This paper presents a software architecture for the networktransparent control of distributed robotic systems. The system consists of two main components: a generic and easily extensible CORBAbased interface to distributed services, and a highlevel XMLbased description language for sp ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract — This paper presents a software architecture for the networktransparent control of distributed robotic systems. The system consists of two main components: a generic and easily extensible CORBAbased interface to distributed services, and a highlevel XMLbased description language for specifying the behavior of the robots. The architecture makes it possible to create dynamically modifiable, extensible control software with ease. It is successfully utilized in implementing a coffee serving system in which the cooperation of two very different robots and two other distributed services are needed. I.
A Comprehensive Survey of Trends in Oracles for Software Testing
, 2013
"... Testing involves examining the behaviour of a system in order to discover potential faults. Determining the desired correct behaviour for a given input is called the “oracle problem”. Oracle automation is important to remove a current bottleneck which inhibits greater overall test automation; witho ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Testing involves examining the behaviour of a system in order to discover potential faults. Determining the desired correct behaviour for a given input is called the “oracle problem”. Oracle automation is important to remove a current bottleneck which inhibits greater overall test automation; without oracle automation, the human has to determine whether observed behaviour is correct. The literature on oracles has introduced techniques for oracle automation, including modelling, specifications, contractdriven development and metamorphic testing. When none of these is completely adequate, the final source of oracle information remains the human, who may be aware of informal specifications, expectations, norms and domain specific information that provide informal oracle guidance. All forms of oracle, even the humble human, involve challenges of reducing cost and increasing benefit. This paper provides a comprehensive survey of current approaches to the oracle problem and an analysis of trends in this important area of software testing research and practice.
Testability analysis of synchronous sequential circuits based on structural data
 In International Test Conference
, 1989
"... Bounds on test sequence length can be used as a testability measure. We give a procedure to compute the upper bound on test sequence length for an arbitrary sequential circuit. We prove that the bound is exact for a certain class of circuits. Three design rules are specified to yield circuits with l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Bounds on test sequence length can be used as a testability measure. We give a procedure to compute the upper bound on test sequence length for an arbitrary sequential circuit. We prove that the bound is exact for a certain class of circuits. Three design rules are specified to yield circuits with lower test sequence bounds. 1
Formal Languages for Linguists: Classical and Nonclassical Models
, 2001
"... The basics of classical formal language theory are introduced, as well as a wide coverage is given of some new nonstandard devices motivated in molecular biology, which are challenging traditional conceptions, are making the theory revived and could have some linguistic relevance. Only definitions a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The basics of classical formal language theory are introduced, as well as a wide coverage is given of some new nonstandard devices motivated in molecular biology, which are challenging traditional conceptions, are making the theory revived and could have some linguistic relevance. Only definitions and a few results are presented, without including any proof. The chapter can be profitably read without any special previous mathematical background. A long list of references completes the chapter, which intends to give a flavour of the field and to encourage young researchers to go deeper into it.