Context-free text grammars

DOI10.1007/BF01192159zbMath0790.68061OpenAlexW2031277438MaRDI QIDQ1323383

Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg

Publication date: 2 June 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192159

zbMATH Keywords

context-free grammarstexts

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Existential MSO over two successors is strictly weaker than over linear orders ⋮ Definable transductions and weighted logics for texts ⋮ Monadic second-order definable text languages ⋮ MSO definable text languages ⋮ Theory of 2-structures

Cites Work

• Unnamed Item
• T-structures, T-functions, and texts
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Theory of 2-structures. II: Representation through labeled tree families
• Angular 2-structures
• Combinatorial properties of texts

This page was built for publication: Context-free text grammars