✦ LIBER ✦

The equivalence problem for LL- and LR-regular grammars

✍ Scribed by Anton Nijholt

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 733 KB
Volume: 24
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90044-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tests for the LR-, LL-, and LC-regular c

Tests for the LR-, LL-, and LC-regular conditions

✍ Stephan Heilbrunner 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Equivalence of regularization and trunca

Equivalence of regularization and truncated iteration for general ill-posed problems

✍ Reginaldo J. Santos 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 322 KB

The Equivalence Problem for DF0L Languag

The Equivalence Problem for DF0L Languages and Power Series

✍ Juha Honkala 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We show that equivalence is decidable for D0L systems with finite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable fields.

Equivalence of regularization and trunca

Equivalence of regularization and truncated iteration in the solution of III-posed image reconstruction problems

✍ Henry E. Fleming 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 856 KB

p-reductive homogeneous spaces and the e

p-reductive homogeneous spaces and the equivalence problem for some transitive structures

✍ Claude Albert 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 622 KB

The complexity of restricted regular exp

The complexity of restricted regular expressions and the synthesis problem for finite automata

✍ Ernst Leiss 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 364 KB