Formal descriptions of code properties: decidability, complexity, implementation
From MaRDI portal
Publication:2909182
DOI10.1142/S0129054112400059zbMATH Open1279.68149MaRDI QIDQ2909182FDOQ2909182
Authors: Krystian Dudzinski, Stavros Konstantinidis 
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Decidability of code properties
- Decidability of code properties
- Formalization of Properties of Functional Programs
- Descriptional complexity of formal systems
- Descriptological foundations of programming
- scientific article; zbMATH DE number 826059
- scientific article; zbMATH DE number 1302020
- Toward complete programming language descriptions that are both formal and understandable
- scientific article; zbMATH DE number 51766
complexitypropertiesautomatacodesdecidabilityimplementationtransducerslanguagesmaximalitydescriptions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shuffle on trajectories: Syntactic constraints
- Coding properties of DNA languages.
- Language equations, maximality and error-detection
- Trajectory-based codes
- Codes defined by multiple sets of trajectories
- A note on finite-valued and finitely ambiguous transducers
- Relations on free monoids, their independent sets, and codes1
- Decidability of code properties
- On properties of bond-free DNA languages
- Thin and slender languages
- Rational equivalence relations
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Transducers and the decidability of independence in free monoids
- Finite maximal solid codes
- Automata theory: Its past and future
Cited In (12)
- On the maximality of languages with combined types of code properties
- Descriptional complexity of error detection
- Theoretical and implementational aspects of the formal language server (LaSer)
- Approximate NFA universality motivated by information theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementation of code properties via transducers
- Methods for relativizing properties of codes
- Approximate NFA universality and related problems motivated by information theory
- Randomized generation of error control codes with automata and transducers
- Block languages and their bitmap representations
- Symbolic manipulation of code properties
This page was built for publication: Formal descriptions of code properties: decidability, complexity, implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909182)
