Block Substitutions and Their Properties

Authors:
Lila Kari;Elena Losseva
Affiliations:
Department of Computer Science The University of Western Ontario London, ON, Canada, N6A 5B7. E-mail: {lila,elena}@csd.uwo.ca;Department of Computer Science The University of Western Ontario London, ON, Canada, N6A 5B7. E-mail: {lila,elena}@csd.uwo.ca
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Year:
2006

Citing 11
Cited 0

Formal languages

Formal languages
On language equations with invertible operations

Theoretical Computer Science
Transducers and the decidability of independence in free monoids

Selected papers of the second international colloquium on Words, languages and combinatorics
Maximal and minimal solutions to language equations

Journal of Computer and System Sciences
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Regular languages

Handbook of formal languages, vol. 1
Codes

Handbook of formal languages, vol. 1
Automata for matching patterns

Handbook of formal languages, vol. 2
Error-detecting properties of languages

Theoretical Computer Science
Theory of Codes

Theory of Codes
Relationships between different error-correcting capabilities of a code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a type of substitution operation inspired by errors occurring in biologically encoded information. We derive the closure properties of language families in the Chomsky hierarchy under these substitution operations. Moreover, we consider some language equations involving these operations and investigate decidability of the existence of solutions to such equations.