Epsilon-reducible context-free languages and characterizations of indexed languages

DOI10.1016/j.ic.2019.104444zbMath1435.68205OpenAlexW2970567955MaRDI QIDQ2280325

Séverine Fratani, El Makki Voundy

Publication date: 18 December 2019

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

Full work available at URL: https://doi.org/10.1016/j.ic.2019.104444

zbMATH Keywords

context-free grammarsindexed languagestransductionshomomorphic characterizations

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Related Items (1)

Special issue: selected papers of the 10th international conference on language and automata theory and applications, LATA 2016

Cites Work

• Linear indexed languages
• Grammars, derivation modes and properties of indexed and type-0 languages
• Transductions des langages de Chomsky
• On infinite transition graphs having a decidable monadic theory
• Multidimensional trees and a Chomsky–Schützenberger–Weir representation theorem for simple context-free tree grammars
• Non-erasing Variants of the Chomsky–Schützenberger Theorem
• The Inclusion Problem of Context-Free Languages: Some Tractable Cases
• Left universal context-free grammars and homomorphic characterizations of languages
• Higher-Order Model Checking: An Overview
• Monoid Automata for Displacement Context-Free Languages
• Indexed Grammars—An Extension of Context-Free Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Epsilon-reducible context-free languages and characterizations of indexed languages