Why it might pay to assume that languages are infinite

DOI10.1007/BF02451546zbMath0942.68597MaRDI QIDQ1353889

Walter J. Savitch

Publication date: 11 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

From compositional to systematic semantics ⋮ Stack-like and queue-like dynamics in recurrent neural networks ⋮ Infinity and the foundations of linguistics

Cites Work

• Unnamed Item
• Economy of description by parsers, DPDA's, and PDA's
• Program size in restricted programming languages
• A note on the succinctness of descriptions of deterministic languages
• On the size of machines