The grammar of mammalian brain capacity

DOI10.1016/j.tcs.2016.03.021zbMath1342.92050arXiv1612.01150OpenAlexW2305551325MaRDI QIDQ290555

F. Blanchet-Sadri, M. Dambrine

Publication date: 1 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.01150

zbMATH Keywords

grammarsbrain allometryhigh-order pushdown automatathalamocortical circuits

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Neural biology (92C20) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The IO- and OI-hierarchies
• Iterated stack automata and complexity classes
• Mathematical methods in linguistics
• A geometric hierarchy beyond context-free languages
• Tree adjunct grammars
• The modal argument for hypercomputing minds
• Sentence and Word Complexity
• On certain formal properties of grammars
• Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
• An automata-theoretical characterization of the OI-hierarchy
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The equivalence of four extensions of context-free grammars
• Three models for the description of language
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata