Middle quotients of linear languages

DOI10.1080/00207169908804811zbMath0926.68066OpenAlexW2054247035MaRDI QIDQ4254654

Alexander Meduna

Publication date: 15 September 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804811

zbMATH Keywords

middle quotient

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Decidability of trajectory-based equations

Cites Work

• On the generative power of regular pattern grammars
• On characterizations of recursively enumerable languages
• Context free derivations on word monoids
• Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
• Generalized forbidding grammars
• A formalization of sequential, parallel, and continuous rewriting
• Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages

This page was built for publication: Middle quotients of linear languages