Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory

An important direction of computational and formal linguistics is to find good (mathematical and computational) models to describe linguistic phenomena. These models can also help to understand language acquisition, thinking and other mental activities. In this paper we consider finite automata with translucent letters. These models do not read their input strictly from left to right as traditional finite automata, but for each internal state of such a device, certain letters are translucent, that is, in this state the automaton cannot see them. We solve the parsing problem of these automata, both in the deterministic and in the nondeterministic cases. By introducing the permutation operator the class of regular languages is extended. It is shown that this extended class inside the class of languages that can be accepted by nondeterministic finite automata with translucent letters. Some interesting examples from the formal language theory and from a segment of the Hungarian language are shown presenting the applicability of finite automata with translucent letters both in formal and natural languages.

[1]  Henning Bordihn,et al.  Mildly Context-Sensitive Grammars , 2004 .

[2]  Benedek Nagy,et al.  Modeling Syntactic Complexity with P Systems: A Preview , 2014, UCNC.

[3]  Maxime Amblard,et al.  A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars , 2006 .

[4]  Shuly Wintner,et al.  Formal Language Theory for Natural Language Processing , 2002, ACL 2002.

[5]  András Kornai,et al.  Natural Languages and the Chomsky Hierarchy , 1985, EACL.

[6]  David Gil,et al.  The World Atlas of Language Structures , 2005 .

[7]  Friedrich Otto,et al.  Globally deterministic CD-systems of stateless R-automata with window size 1 , 2013, Int. J. Comput. Math..

[8]  Robert J. Matthews,et al.  Are the grammatical sentences of a language a recursive set? , 1979, Synthese.

[9]  Philippe Flajolet,et al.  Dynamical Sources in Information Theory : A General Analysis of Trie Structures , 1999 .

[10]  Friedrich Otto,et al.  On CD-systems of stateless deterministic R-automata with window size one , 2012, J. Comput. Syst. Sci..

[11]  Sheng Yu,et al.  Transition Complexity of Incomplete DFAs , 2011, Fundam. Informaticae.

[12]  M. Dryer.  On the Six-Way Word Order Typology , 1997 .

[13]  László Kovács,et al.  Linguistic Applications of Finite Automata with Translucent Letters , 2018, ICAART.

[14]  Geoffrey K. Pullum,et al.  Natural languages and context-free languages , 1982 .

[15]  C. F. Hockett.  A Manual of Phonology , 2013 .

[16]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[17]  P. A. Reich.  The Finiteness of Natural Language , 1969 .

[18]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.