Notation and Formal Language Theory

1979 ◽  
pp. 253-276
Author(s):  
Richard Bornat
Keyword(s):  
Formal Language ◽  
Formal Language Theory ◽  
Language Theory

THE DEVELOPMENT OF FORMAL LANGUAGE THEORY SINCE 1956

1990 ◽  
Vol 01 (04) ◽  
pp. 355-368
Author(s):  
ROBERT McNAUGHTON
Keyword(s):  
Formal Language ◽  
Formal Languages ◽  
Early Years ◽  
Formal Language Theory ◽  
Language Theory ◽  
Personal Interest

This brief survey will discuss the early years of the theory of formal languages through about 1970, treating only the most fundamental of the concepts. The paper will conclude with a brief discussion of a small number of topics, the choice reflecting only the personal interest of the author.

scholarly journals What can formal language theory do for animal cognition studies?

2020 ◽  
Vol 7 (2) ◽  
pp. 191772
Author(s):  
Aniello De Santo ◽  
Jonathan Rawski
Keyword(s):  
Formal Language ◽  
Animal Cognition ◽  
Formal Language Theory ◽  
Language Theory

scholarly journals SOME PROPERTIES OF FIBONACCI LANGUGAES

1996 ◽  
Vol 27 (2) ◽  
pp. 165-182
Author(s):  
CHENG-MING FAN ◽  
H. J. SHYR
Keyword(s):  
Formal Language ◽  
Free Monoid ◽  
Formal Language Theory ◽  
Language Theory ◽  
Primitive Word ◽  
Algebraic Properties

Two particular types of Fibonacci languages $F_{a, b}^1=\{a, b, ab, bab, abbab, \cdots \}$ and $F_{a, b}^0=\{a, b, ba, bab, babba, \cdots \}$ were defined on the free monoid $X^*$ generated by the alphabet $X = \{a, b\}$. In this paper we investigate some algebraic properties of these two types of Fibonacci languages. We show that a general Fi­bonacci language is a homomorphical image of either $F_{a, b}^1$ or $F_{a, b}^0$. We also study the properties of Fibonacci language related to formal language theory and codes We obtained the facts that every Fibonacci word is a primitive word and for any $u \in X^+$, $u^4$ is not a subword of any words in both $F_{a, b}^1$ and $F_{a, b}^0$.    

Sign in / Sign up

Export Citation Format

Share Document