Deciding Code Related Properties by Means of Finite Transducers

Head, Tom; Weber, Andreas

doi:10.1007/978-1-4613-9323-8_19

Cited by 16 publications

(7 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This yields a method for deciding whether a given regular code of the type defined by the inequation is maximal. We note that uniform methods for deciding code-related properties of regular languages have been considered in [6,4]. However, to our knowledge, there is no analogous uniform method for deciding the maximality property.…”

Section: Introductionmentioning

confidence: 96%

Language equations, maximality and error-detection

Kari

Konstantinidis

2005

Journal of Computer and System Sciences

View full text Add to dashboard Cite

We use some 'natural' language operations, such as shuffle (scattered insertion) and scattered deletion to model noisy channels, that is, nondeterministic processes transforming words to words. In this spirit, we also introduce the operation of scattered substitution and derive the closure properties of the language families in the Chomsky hierarchy under this operation. Moreover, we consider a certain type of language inequations involving language operations and observe that, by varying the parameters of such an inequation, we can define families of codes such as prefix and infix, as well as families of error-detecting languages. Our results on this type of inequations include a characterization of the maximal solutions, which provides a uniform method for deciding whether a given regular code of the type defined by the inequation is maximal.

show abstract

Section: Introductionmentioning

confidence: 96%

Language equations, maximality and error-detection

Kari

Konstantinidis

2005

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…This property is not defined via a transducer and is treated differently. In particular the witness version of the satisfaction problem is solved based on the decision algorithm of [12]-see [17] for details. Next we only show an example of how one can use the satisfaction method.…”

Section: Methods Of Code Property Objectsmentioning

confidence: 99%

Implementation of Code Properties via Transducers

Konstantinidis¹,

Meijer²,

Moreira

et al. 2016

Implementation and Application of Automata

View full text Add to dashboard Cite

Abstract. The FAdo system is a symbolic manipulator of formal language objects, implemented in Python. In this work, we extend its capabilities by implementing methods to manipulate transducers and we go one level higher than existing formal language systems and implement methods to manipulate objects representing classes of independent languages (widely known as code properties). Our methods allow users to define their own code properties and combine them between themselves or with fixed properties such as prefix codes, suffix codes, error detecting codes, etc. The satisfaction and maximality decision questions are solvable for any of the definable properties. The new online system LaSer allows one to query about a code property and obtain the answer in a batch mode. Our work is founded on independence theory as well as the theory of rational relations and transducers, and contributes with improved algorithms on these objects.

show abstract

“…complexity. Our implementation follows the algorithm in [12], as that approach makes use of the transducer functionality algorithm. As before we enhance that algorithm to produce a witness of non-satisfaction which, given an NFA object a, it either returns the pair (None, None) if L(a) is a UD code, or a pair of two different lists of L(a)-words such that the concatenation of the words in each list produces the same word (if L(a) is not a UD code).…”

Section: Methods Pmaximalp(a B)mentioning

confidence: 99%

“…To our knowledge such implementations are not openly available. In particular, the satisfaction of the classic property of unique decipherability, or decodability, is implemented for any given NFA based on the algorithm in [12] as well as the satisfaction of various error-detecting properties [16].…”

Section: Introductionmentioning

confidence: 99%

Symbolic Manipulation of Code Properties

Konstantinidis,

Meijer,

Moreira

et al. 2015

Preprint

View full text Add to dashboard Cite

The FAdo system is a symbolic manipulator of formal languages objects, implemented in Python. In this work, we extend its capabilities by implementing methods to manipulate transducers and we go one level higher than existing formal language systems and implement methods to manipulate objects representing classes of independent languages (widely known as code properties). Our methods allow users to define their own code properties and combine them between themselves or with fixed properties such as prefix codes, suffix codes, error detecting codes, etc. The satisfaction and maximality decision questions are solvable for any of the definable properties. The new online system LaSer allows to query about code properties and obtain the answer in a batch mode. Our work is founded on independence theory as well as the theory of rational relations and transducers and contributes with improveded algorithms on these objects.

show abstract

Deciding Code Related Properties by Means of Finite Transducers

Cited by 16 publications

References 16 publications

Language equations, maximality and error-detection

Language equations, maximality and error-detection

Implementation of Code Properties via Transducers

Symbolic Manipulation of Code Properties

Contact Info

Product

Resources

About