Cargando…
Context-Freeness of Word-MIX Languages
In this paper we provide a decidable characterisation of the context-freeness of a Word-MIX language [Formula: see text], where [Formula: see text] is the set of all words over [Formula: see text] that contain the same number of subword occurrences of parameter words [Formula: see text].
Autor principal: | Sin’Ya, Ryoma |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247905/ http://dx.doi.org/10.1007/978-3-030-48516-0_23 |
Ejemplares similares
-
Central limit theorem for the hierarchy of freeness
por: Franz, U, et al.
Publicado: (1998) -
The Blind Watchmaker Network: Scale-Freeness and Evolution
por: Minnhagen, Petter, et al.
Publicado: (2008) -
Equivariant K-theory and freeness of group actions on C*-algebras
por: Phillips, N Christopher
Publicado: (1987) -
Lattices in a product of trees, hierarchically hyperbolic groups and virtual torsion‐freeness
por: Hughes, Sam
Publicado: (2022) -
A novel multi-word paradigm for investigating semantic context effects in language production
por: van Scherpenberg, Cornelia, et al.
Publicado: (2020)