On regular languages over power sets
The power set of a finite set is used as the alphabet of a string interpreting a sentence of Monadic Second-Order Logic so that the string can be reduced (in a straightforward way) to the symbols occurring in the sentence. Simple extensions to regular expressions are described matching the succinct...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2016-04-01
|
| Series: | Journal of Language Modelling |
| Subjects: | |
| Online Access: | https://jlm.ipipan.waw.pl/index.php/JLM/article/view/103 |