A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Towards a Theory of Complexity of Regular Languages
[article]

2017
*
arXiv
*
pre-print

the quotient

arXiv:1702.05024v1
fatcat:gzkyubh2ireizdsuu6fpqy6ece
*complexity**of*its atoms -- basic components*of*every*regular**language*. ... We survey recent results concerning the*complexity**of**regular**languages*represented by their minimal deterministic finite automata. ... The number*of*atoms*of**a**regular**language*L is equal to the*complexity**of*L R . Before discussing the next relationships we need to introduce certain concepts from group*theory*. ...##
###
What can formal language theory do for animal cognition studies?

2020
*
Royal Society Open Science
*

We conclude with suggestions for the contribution

doi:10.1098/rsos.191772
pmid:32257333
pmcid:PMC7062054
fatcat:uxlj5h64cbddnaylmj2d7y7kky
*of*formal*language**theory*(henceforth, FLT) to comparative cognition. ... Given any*regular**language*, it is always possible to write*a*context-free grammar that characterizes said*language*. ...##
###
Preface
[chapter]

2022
*
Automata Theory and Formal Languages
*

Automata

doi:10.1515/9783110752304-202
fatcat:hhmfiy4afnbmnja2vlok67glpi
*theory*and formal*languages*are the cornerstone*of*computer science and all information processing pursuits. ... These fundamentals are at the center*of*any computer science, computer engineering and information technologies curriculum. Writing*a*textbook in this area is*a*challenging endeavor. ... and then move*toward*the class*of*recursively enumerable*languages*, the most*complex*class*of**languages*(Chapters 2, 3 and 4). ...##
###
Page 1307 of Mathematical Reviews Vol. , Issue 2003B
[page]

2003
*
Mathematical Reviews
*

More- over, we compare the succinctness

*of*the description*of**regular**languages*by*regular*grammars (without control) and*regular*grammars with*regular*control.” ... Aside from its technical content, the article has two attractive aspects: it is written with an unyielding attention*toward*clarity and it supplies an integrated view*of*the development*of**a**theory*(not ...##
###
The Complexity of Mathematics

2020
*
Zenodo
*

We prove the Riemann hypothesis using the

doi:10.5281/zenodo.3874916
fatcat:lgqb33xw7bh4xoerwqfgbdhfay
*Complexity**Theory*. Number*theory*is*a*branch*of*pure mathematics devoted primarily to the study*of*the integers and integer-valued functions. ... We show the Goldbach's conjecture is true using the*Complexity**Theory*as well. An important*complexity*class is 1NSPACE(S(n)) for some S(n). ... L is*a*well-known non-*regular**language*using the Pumping lemma for*regular**languages*[17] . Definition 4. ...##
###
Dynamic systems and SLA: The wood and the trees

2007
*
Bilingualism: Language and Cognition
*

*A*DST (Dynamic Systems

*Theory*) characterization

*of*L2 acquisition as an emergent process marks the coming

*of*age

*of*SLA research. ... It is an important theoretical maturation in that it brings together the many factors that interact in the

*complex*system

*of*

*language*, learning, and use. ... Children typically show

*a*"vocabulary burst"

*towards*the end

*of*their second year which follows

*a*milestone typical

*of*an 18 month old where they "read" board books on their own. ...

##
###
The Complexity of Mathematics

2020
*
Zenodo
*

We prove the Riemann hypothesis using the

doi:10.5281/zenodo.3875613
fatcat:to3hicqoqbbnjffc45qnng7fpa
*Complexity**Theory*. Number*theory*is*a*branch*of*pure mathematics devoted primarily to the study*of*the integers and integer-valued functions. ... We show the Goldbach's conjecture is true using the*Complexity**Theory*as well. An important*complexity*class is 1NSPACE(S(n)) for some S(n). ... tends*towards*1) [5] , [7] . ...##
###
RegExpert: A Tool for Visualization of Regular Expressions

2007
*
EUROCON 2007 - The International Conference on "Computer as a Tool"
*

To increase the interactivity

doi:10.1109/eurcon.2007.4400374
fatcat:tc25vi66nbbbdczjvjoufdi6by
*of*computer science education, we have developed RegExpert,*a*tool for*regular**language*manipulation and visualization. ... The main goal*of*the RegExpert tool is to simplify and visually present*complex*concepts and mathematical models*of*automata*theory*fundamentals. ... Softlab is an extension*of*Automata Simulator*towards**a*fully distributed e-learning tool. ...##
###
Page 347 of Mathematical Reviews Vol. , Issue 86a
[page]

1986
*
Mathematical Reviews
*

Then, their computation power is investigated using SPS

*languages*from the following viewpoints: (*a*) inclusion relations among the set*of*target SPS*languages*, the set*of**regular*sets, the set*of**languages*... We show in this paper that the binary*languages*(i.e.,*languages*over*a*two- symbol alphabet) recognized by such machines are all*regular*. ...##
###
THE EVOLUTION OF SYNTACTIC CAPACITY FROM NAVIGATIONAL ABILITY

2006
*
The Evolution of Language
*

With this representation, planning or following

doi:10.1142/9789812774262_0051
fatcat:uq2ida62ozcydjnhhmqldn6w64
*a*path is equivalent to generating or parsing, respectively,*a*sentence*of**a**regular**language*(RL). ... Should the navigational needs*of*individuals necessitate return along the same path as the outward journey, the navigational task requires*a*more*complex*formulation equivalent to*a*context-free*language*... Such results point*towards**a*possible source*of*evolutionary pressure for the ability to use*language*. ...##
###
On the Complexity of Infinite Advice Strings

2018
*
International Colloquium on Automata, Languages and Programming
*

Turing machines) and C

doi:10.4230/lipics.icalp.2018.122
dblp:conf/icalp/Doueneau-Tabot18
fatcat:73yhszegivf5njr53nv3d54jga
*a*class*of*objects (e.g.*languages*), the*complexity**of*an infinite word α can be measured with respect to the amount*of*objects from C that are presentable with machines from M using ... In our case, the model M is finite automata and the objects C are either recognized*languages*or presentable structures, known respectively as advice*regular**languages*and advice automatic structures. ... R p ;*A*δ , R 1 . . . R p / ∼ is isomorphic to B. 2 0 1 8 122:6 On the*Complexity**of*Infinite Advice Strings Example Let Reg ∞ [α] be the class*of*non-terminating*regular**languages*with advice α. ...##
###
A Learning-Style Theory for Understanding Autistic Behaviors

2011
*
Frontiers in Human Neuroscience
*

Quantitative simulations will pose

doi:10.3389/fnhum.2011.00077
pmid:21886617
pmcid:PMC3155869
fatcat:eaxfuexfxzdefiqwrktohw5mee
*a*major challenge, particularly for*complex*tasks such as*language*and social interaction, due to the lack*of*mechanistic neural models. ... Context dependence is*a*form*of*statistical*regularity*. ...##
###
EVOLUTIONARY PATHS TO COMPOSITIONAL LANGUAGE

2014
*
The Evolution of Language
*

*of*

*a*lexicon and

*a*simpler,

*regular*

*language*parser, which only handled order. ...

*a*path

*towards*

*a*resource as

*a*sequence

*of*landmarks. ...

##
###
The Complexity of Mathematics

2020
*
Zenodo
*

We prove the Riemann hypothesis using the

doi:10.5281/zenodo.3758507
fatcat:abcq2tz6nfb2fmrgouto5vjgkm
*Complexity**Theory*. Number*theory*is*a*branch*of*pure mathematics devoted primarily to the study*of*the integers and integer-valued functions. ... We show the Goldbach's conjecture is true using the*Complexity**Theory*as well. An important*complexity*class is 1NSPACE(S(n)) for some S(n). ... L is*a*well-known non-*regular**language*using the Pumping lemma for*regular**languages*[17] , [15] . Definition 10. ...##
###
The Complexity of Mathematics

2020
*
Zenodo
*

We prove the Riemann hypothesis using the

doi:10.5281/zenodo.3765949
fatcat:zjupadnptbenrkfeu4gsjp3xfe
*Complexity**Theory*. Number*theory*is*a*branch*of*pure mathematics devoted primarily to the study*of*the integers and integer-valued functions. ... We show the Goldbach's conjecture is true using the*Complexity**Theory*as well. An important*complexity*class is 1NSPACE(S(n)) for some S(n). ... L is*a*well-known non-*regular**language*using the Pumping lemma for*regular**languages*[17] , [15] . Definition 10. ...
« Previous

*Showing results 1 — 15 out of 256,891 results*