학술논문
Locally noncounting languages.
Document Type
Journal
Author
Kuan, L. Y. AMS Author Profile; Thierrin, G. AMS Author Profile
Source
Subject
68 Computer science -- 68F Linguistics
68F05Formal languages, grammars
68F05
Language
English
Abstract
A language $L$ over the alphabet $X$ is said to be locally noncounting (LN) if for some nonnegative integer $n$ and all $x,y\in x^\ast$ and $a\in x$ we have $xa^{n+1}y\in L\Leftrightarrow xa^ny\in L$. There exist LN-languages which are not noncounting languages; the family of LN-languages is closed under the operations of union, intersection, concatenation and complementation, etc.