A property of real-time trellis automata (Q1079372): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: On real-time cellular automata and trellis automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Systolic trellis automatata † / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Systolic trellis automatat† / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations and computational complexity of systolic trellis automata / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(86)90025-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2019846069 / rank | |||
Normal rank |
Latest revision as of 10:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A property of real-time trellis automata |
scientific article |
Statements
A property of real-time trellis automata (English)
0 references
1986
0 references
If L is a language acceptable by a real-time trellis automaton having N states [for the definition see for instance \textit{K. Culik II}, \textit{J. Gruska} and \textit{A. Salomaa}, Int. J. Comput. Math. 15, 195-212 (1984; Zbl 0571.68041)] and there exist words x, w such that \(xw^*\cap L\) is infinite then there exists a natural k and a natural \(K\leq N^{| x| +1}\) such that for all \(n\geq 0\) the words \(xw^{k+nK}\) belong to L. Making use of this property one can sometimes easily show that a given language is no real-time trellis language. The author illustrates this for \(L_ 1=\{a^ nb^{mn}:\) \(n,m>0\}\), \(L_ 2=\{a^{2^ n}:\) \(n\geq 0\}\), and \(L_ 3=\{a^ p:\) p is a prime\(\}\).
0 references
real-time acceptance
0 references