Pumping lemmas for term languages

DOI10.1016/0022-0000(78)90012-0zbMath0388.68071OpenAlexW1973562412WikidataQ124819654 ScholiaQ124819654MaRDI QIDQ1250713

Thomas S. E. Maibaum

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90012-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Self-embedding indexed grammars ⋮ The structure of index sets and reduced indexed grammars ⋮ Restarting Tree Automata and Linear Context-Free Tree Languages ⋮ Recognizable formal power series on trees

Cites Work

• Unnamed Item
• Unnamed Item
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• A generalized approach to formal languages
• Generalized sequential machine maps
• Initial Algebra Semantics and Continuous Algebras
• Intercalation theorems for stack languages
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Tree generating regular systems
• Indexed Grammars—An Extension of Context-Free Grammars
• Mappings and grammars on trees

This page was built for publication: Pumping lemmas for term languages