Decidability of regularity and related properties of ground normal form languages

DOI10.1006/inco.1995.1054zbMath0834.68066OpenAlexW2120953967WikidataQ58064543 ScholiaQ58064543MaRDI QIDQ1891136

Gregory Kucherov, Mohamed Tajine

Publication date: 28 May 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1054

zbMATH Keywords

rewriting systemfinite irreducibility

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Test sets for the universal and existential closure of regular tree languages. ⋮ Classes of Tree Homomorphisms with Decidable Preservation of Regularity ⋮ The HOM Problem is EXPTIME-Complete ⋮ Recognizable tree-languages and nonlinear morphisms

This page was built for publication: Decidability of regularity and related properties of ground normal form languages