Unrestricted complementation in language equations over a one-letter alphabet
From MaRDI portal
Publication:1334656
DOI10.1016/0304-3975(94)90227-5zbMATH Open0821.68076OpenAlexW2064508306MaRDI QIDQ1334656FDOQ1334656
Authors: Ernst L. Leiss 
Publication date: 25 September 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90227-5
Recommendations
- Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
- Language equations with complementation: expressive power
- Unambiguous conjunctive grammars over a one-letter alphabet
- On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
- On language equations with one-sided concatenation
- Computational universality in one-variable language equations
- On the expressibility of languages by word equations with a bounded number of variables
- Unambiguous conjunctive grammars over a one-symbol alphabet
- scientific article; zbMATH DE number 5238362
- Language Equations with Complementation
Cites Work
- Title not available (Why is that?)
- Generalized language equations with multiple solutions
- On equations for regular languages, finite automata, and sequential networks
- Title not available (Why is that?)
- On generalized language equations
- On solving star equations
- Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
Cited In (24)
- On the expressive power of univariate equations over sets of natural numbers
- Implicit language equations: existence and uniqueness of solutions
- On solving star equations
- Generalized language equations with multiple solutions
- Locally stratified Boolean grammars
- Equations over sets of integers with addition only
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Concatenation-free languages
- Language equations with complementation: expressive power
- Unresolved systems of language equations: expressive power and decision problems
- Language equations with complementation: decision problems
- Decision problems for language equations
- The dual of concatenation
- On equations over sets of numbers and their limitations
- Boolean grammars
- Language equations
- Computational completeness of equations over sets of natural numbers
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Formal languages over GF(2)
- Aspects of shuffle and deletion on trajectories
- Regular solutions of language inequalities and well quasi-orders
- On Equations over Sets of Numbers and Their Limitations
- On the role of complementation in implicit language equations and relations
- Least and greatest solutions of equations over sets of integers
This page was built for publication: Unrestricted complementation in language equations over a one-letter alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334656)
