11 years 10 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
108views more  JUCS 2002»
13 years 2 months ago
Heyting Algebras and Formal Languages
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
111views more  GRAMMARS 1998»
13 years 2 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
126views more  INFORMATICALT 2000»
13 years 2 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
101views more  FMSD 2007»
13 years 2 months ago
Timed substitutions for regular signal-event languages
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
Béatrice Bérard, Paul Gastin, Antoin...
107views more  JUCS 2006»
13 years 2 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
78views Education» more  CORR 2010»
13 years 2 months ago
On the Iterated Hairpin Completion
The hairpin completion is a natural operation on formal languages which has been inspired by biochemistry and DNA-computing. In this paper we solve two problems which were posed f...
Steffen Kopecki
ACL Anthology
13 years 4 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
13 years 4 months ago
Verification of Cooperating Systems - An Approach Based on Formal Languages
Behaviour of systems is described by formal languages: the sets of all sequences of actions. Regarding ion, alphabetic language homomorphisms are compute abstract behaviours. To a...
Peter Ochsenschläger, Jürgen Repp, Rolan...
13 years 4 months ago
A New Knowledge Representation Model to Support Multilingual Ontologies. A case Study
- Knowledge extraction methods have not efficiently evolved towards new methods to automate the process of building multilingual ontologies as the main representation of structured...
Jesús Cardeñosa, Carolina Gallardo, ...