Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492902zbMATH OpenOpenAlexFDO

Authors Alexander Okhotin

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Decision problems for language equations
• Unresolved systems of language equations: expressive power and decision problems
• Language equations with complementation: decision problems
• Language Equations with Complementation
• Developments in Language Theory

Cited in

(9)

• Language equations
• Computational completeness of equations over sets of natural numbers
• On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
• Regular solutions of language inequalities and well quasi-orders
• Developments in Language Theory
• Least and greatest solutions of equations over sets of integers
• Decision problems for systems of language equations and inequations
• Unresolved systems of language equations: expressive power and decision problems
• Language equations with complementation: decision problems

This page was built for publication: Mathematical Foundations of Computer Science 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492902)