Skip to main content
Journal Article

Structural equivalence of regularly extended E0L grammars: An automata theoretic proof

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3113 259-267
DOI: 10.1007/978-3-540-27812-2_23
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Regularly extended E0L grammars allow an infinite number of rules for a given nonterminal provided that the set of right sides of the rules for each nonterminal is a regular language. We show that structural equivalence remains decidable for regularly extended E0L grammars. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Salomaa, K., & Wood, D. (2004). Structural equivalence of regularly extended E0L grammars: An automata theoretic proof. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3113, 259–267. https://doi.org/10.1007/978-3-540-27812-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free