Standard

Notes on dual concatenation. / Okhotin, Alexander.

In: International Journal of Foundations of Computer Science, Vol. 18, No. 6, 01.12.2007, p. 1361-1370.

Research output: Contribution to journal › Article › peer-review

Harvard

Okhotin, A 2007, 'Notes on dual concatenation', International Journal of Foundations of Computer Science, vol. 18, no. 6, pp. 1361-1370. https://doi.org/10.1142/S0129054107005406

APA

Okhotin, A. (2007). Notes on dual concatenation. International Journal of Foundations of Computer Science, 18(6), 1361-1370. https://doi.org/10.1142/S0129054107005406

Vancouver

Okhotin A. Notes on dual concatenation. International Journal of Foundations of Computer Science. 2007 Dec 1;18(6):1361-1370. https://doi.org/10.1142/S0129054107005406

Author

Okhotin, Alexander. / Notes on dual concatenation. In: International Journal of Foundations of Computer Science. 2007 ; Vol. 18, No. 6. pp. 1361-1370.

BibTeX

@article{49de9bd0522247cfb688c061ab1b96b0,
title = "Notes on dual concatenation",
abstract = "It was recently found that concatenation of formal languages has a logical dual (A. Okhotin, The dual of concatenation, Theoret. Comput. Sci., 345 (2005), 425-447). In this paper, the closure or nonclosure of common language families under dual concatenation with finite, co-finite and regular languages is determined. In addition, language equations with union, linear concatenation and dual concatenation with co-finite constants are shown to be almost equal in power to linear conjunctive grammars.",
keywords = "Concatenation, Conjunctive grammars, Language equations",
author = "Alexander Okhotin",
year = "2007",
month = dec,
day = "1",
doi = "10.1142/S0129054107005406",
language = "English",
volume = "18",
pages = "1361--1370",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "WORLD SCIENTIFIC PUBL CO PTE LTD",
number = "6",

}

RIS

TY - JOUR

T1 - Notes on dual concatenation

AU - Okhotin, Alexander

PY - 2007/12/1

Y1 - 2007/12/1

N2 - It was recently found that concatenation of formal languages has a logical dual (A. Okhotin, The dual of concatenation, Theoret. Comput. Sci., 345 (2005), 425-447). In this paper, the closure or nonclosure of common language families under dual concatenation with finite, co-finite and regular languages is determined. In addition, language equations with union, linear concatenation and dual concatenation with co-finite constants are shown to be almost equal in power to linear conjunctive grammars.

AB - It was recently found that concatenation of formal languages has a logical dual (A. Okhotin, The dual of concatenation, Theoret. Comput. Sci., 345 (2005), 425-447). In this paper, the closure or nonclosure of common language families under dual concatenation with finite, co-finite and regular languages is determined. In addition, language equations with union, linear concatenation and dual concatenation with co-finite constants are shown to be almost equal in power to linear conjunctive grammars.

KW - Concatenation

KW - Conjunctive grammars

KW - Language equations

UR - http://www.scopus.com/inward/record.url?scp=35649019316&partnerID=8YFLogxK

U2 - 10.1142/S0129054107005406

DO - 10.1142/S0129054107005406

M3 - Article

AN - SCOPUS:35649019316

VL - 18

SP - 1361

EP - 1370

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 6

ER -

ID: 41141553