DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Interchange lemma
Interchange lemma
Extended Finite Autómata O Ver Group S
A Second Course in Formal Languages and Automata Theory Jeffrey Shallit Index More Information
Applications of an Infinite Square-Free Co-Cfl”
On the Language of Primitive Words*
Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style
Comparisons of Parikh's Condition
Extended Finite Automata Over Groups
Position-And-Length-Dependent Context-Free Grammars – a New Type of Restricted Rewriting
On the Succinctness Properties of Unordered Context-Free Grammars M
Languages Generated by Iterated Idempotencies Klaus-Peter Leupold Isbn: Núm
Comparisons of Parikh's Condition to Other Conditions for Context-Free Languages
Generalized Results on Monoids As Memory
The Accepting Power of Finite Automata Over Groups
EPTCS 252 Automata and Formal Languages
Second Course in Formal Languages and Automata Theory
Restricted Turing Machines and Language Recognition
Context-Free Languages∗
New Results on Context-Free Tree Languages
Top View
Regular Languages: to Finite Automata and Beyond Succinct Descriptions and Optimal Simulations
A Solution to Yamakami's Problem on Non-Uniform Context-Free Languages
Mathematics of Language
Intercalation Properties of Context-Free Languages Rattikorn Boonyavatana Iowa State University