𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deciding regularity of hairpin completions of regular languages in polynomial time

✍ Scribed by Volker Diekert; Steffen Kopecki; Victor Mitrana

Book ID
113642049
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
508 KB
Volume
217
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decidability of the consistency problem
Decidability of the consistency problem for regular symbolic picture description languages
✍ G. Costagliola; V. Deufemia; F. Ferrucci; C. Gravino πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 86 KB

In the paper we address the consistency problem for drawn symbolic picture grammars. In particular we prove that it is always possible to decide whether or not a regular grammar generates only consistent descriptions of drawn symbolic pictures.