Decision problems for language equations
type: Item
instance of: scholarly article
title: Decision problems for language equations
zbMATH Open document ID: 1201.68067
author: Alexander Okhotin
published in: Journal of Computer and System Sciences
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5711903
zbMATH Keywords: language equations
zbMATH Keywords: Boolean operations
zbMATH Keywords: computability
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
full work available at URL: j.jcss.2009.08.002
OpenAlex ID: W2135734455
cites work: Q4525271
cites work: Unification of concept terms in description logics
cites work: Reversal-bounded multipushdown machines
cites work: On equations for regular languages, finite automata, and sequential networks
cites work: Set constraints in some equational theories
cites work: Q5639639
cites work: Closure and decidability properties of some language classes with respect to ciliate bio-operations.
cites work: Two Families of Languages Related to ALGOL
cites work: Q5583856
cites work: The Equivalence Problem of Finite Substitutions on ab*c, with Applications
cites work: Conway's problem for three-word sets.
cites work: Language equations, maximality and error-detection
cites work: Maximal and minimal solutions to language equations
cites work: Unrestricted complementation in language equations over a one-letter alphabet
cites work: Q4531380
cites work: Conjunctive grammars and systems of language equations
cites work: Boolean grammars
cites work: Q5573961
cites work: Q5588675
cites work: Domain mu-calculus
DOI: 10.1016/J.JCSS.2009.08.002
description: scientific article; zbMATH DE number 5711903