Theoretical and implementational aspects of the formal language server (LaSer)

DOI10.1007/978-3-030-51466-2_25OpenAlexW3037302787MaRDI QIDQ2106613

Stavros Konstantinidis

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_25

zbMATH Keywords

maximalityimplementationregular languagescodesDNA codesindependent languagesproperty satisfaction

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• FAdo

Cites Work

• Site-directed insertion: decision problems, maximality and minimality
• Testing DNA code words properties of regular languages
• Coding properties of DNA languages.
• Transducer descriptions of DNA code properties and undecidability of antimorphic problems
• An algebra of discrete channels that involve combinations of three basic error types
• Trajectory-based codes
• Applications of transducers in independent languages, word distances, codes
• Bond-free DNA language classes
• On Relations Defined by Generalized Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theoretical and implementational aspects of the formal language server (LaSer)