Skip to main content
Conference ProceedingsOPEN ACCESS

Some computational limits of trellis automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10248 LNCS 176-186
DOI: 10.1007/978-3-319-58631-1_14
6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate some computational limits of trellis automata. Reusing a counting argument introduced in [4], we show that: {x1... xny1... yn: xiyi∈ {ab, ba, bb} for i = 1,... , n} is not a trellis language.

Cite

CITATION STYLE

APA

Terrier, V. (2017). Some computational limits of trellis automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10248 LNCS, pp. 176–186). Springer Verlag. https://doi.org/10.1007/978-3-319-58631-1_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free