Tree adjunct languages as integer set recognizers†

DOI10.1080/00207167908803160zbMATH Open0412.68068OpenAlexW2058021194MaRDI QIDQ4199554FDOQ4199554

Vijay K. Vaishnavi, Somenath Biswas

Publication date: 1979

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908803160

zbMATH Keywords

context-free languagespumping lemmainteger set recognizerstree adjunct grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the base-dependence of sets of numbers recognizable by finite automata
• Tree adjunct grammars
• Unrecognizable Sets of Numbers
• On the Recognition of Primes by Automata

This page was built for publication: Tree adjunct languages as integer set recognizers†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199554)