Context-Freeness of Word-MIX Languages (Q5041269)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7601079

Language	Label	Description	Also known as
English	Context-Freeness of Word-MIX Languages	scientific article; zbMATH DE number 7601079

Statements

scholarly article

0 references

Context-Freeness of Word-MIX Languages (English)

0 references

0 references

Developments in Language Theory

0 references

publication date

13 October 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-48516-0_23

0 references

MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies

0 references

On Context-Free Languages

0 references

Counting subwords and regular languages

0 references

A sharpening of the Parikh mapping

0 references

Subword histories and Parikh matrices

0 references

Absoluteness of subword inequality is undecidable

0 references

Unambiguous Constrained Automata

0 references

0 references

A pumping lemma for \textbf{DLI}-languages

0 references

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems

0 references

The context-freeness of the languages associated with vector addition systems is decidable

0 references

0 references

Identifiers

10.1007/978-3-030-48516-0_23

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5041269

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5041269&oldid=37161701"