The Unsolvability of the Recognition of Linear Context-Free Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Checking automata and one-way stack languages
Journal of Computer and System Sciences
Multitape one-way nonwriting automata
Journal of Computer and System Sciences
Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
IEEE Transactions on Computers
| Hi-index | 0.00 |
A one-to-one correspondence is established between the class of all equal matrix languages and the class of finite-turn checking automata. This checking automaton is provided with a counter in its memory to keep track of the number of turns of the stack-head. Several closure properties of this family are established.