On context-free languages and push-down automata

Forgetting Automata and Context-Free Languages

Monoid Automata for Displacement Context-Free Languages

In 2007 Kambites presented an algebraic interpretation of Chomsky-Schützenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of kdisplacement context-free languages in terms of monoid automata a...

Automata Accepting Coupled-Context-Free Languages

Context-Free Language Induction by Evolution of Deterministic Push-Down Automata Using Genetic Programming<

The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on Context-Free Languages (CFL’s) as defined by Context-Free Grammars (CFG’s), some of which are accepted by Deterministic Push-Down A...

Automata Arrays and Context-free Languages Justus-liebig- Universit at Gieeen Automata Arrays and Context-free Languages

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 scientiic 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 investigations concerns their capabilities to accep...