2026/07/01 by A. E. Gutman, А. Е. Гутман
Computer Science · #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Natural Language Processing Techniques
paper · doi:10.1134/s003744662604004x
crossref issued 2026/07/01 · crossref published 2026/07/01 · crossref published-print 2026/07/01 · openalex publication_date 2026/07/01 · crossref published-online 2026/07/30 · crossref created 2026/07/30 · crossref deposited 2026/07/30 · crossref indexed 2026/07/30 · openalex created_date 2026/07/31 · openalex updated_date 2026/08/01
For an arbitrary deterministic longest-prefix rewriting system, a criterion is obtained for the infinite rewritability of a word, on the basis of which an effective procedure is developed for analyzing the rewriting sequence.