Automata Arrays and Context-Free Languages

Martin Kutrib ()
Additional contact information
Martin Kutrib: University of Giessen, Institute of Informatics

Chapter Chapter 12 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 139-148 from Springer

Abstract: Abstract From a biological point of view automata arrays have been employed by John von Neumann in order to solve the logical problem of nontrivial self-reproduction. From a computer science point of view they are a model for massively parallel computing systems. Here we are dealing with automata arrays as acceptors for formal languages. Our focus of investigation concerns their capabilities to accept the classical linguistic languages. While there are simple relations to the regular and context-sensitive ones, here we shed some light on the relations to the context-free languages and some of their important subfamilies.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_12

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().