T-structures, T-functions, and texts

DOI10.1016/0304-3975(93)90323-LzbMath0783.68097OpenAlexW2004765838MaRDI QIDQ685376

Grzegorz Rozenberg, Andrzej Ehrenfeucht

Publication date: 17 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90323-l

zbMATH Keywords

textordersdirected graphsgrammars2-structures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Related Items (11)

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 ⋮ Combinatorial properties of texts ⋮ MSO definable text languages ⋮ Dynamic labeled 2-structures ⋮ Theory of 2-structures ⋮ Embedding linear orders in grids ⋮ Weighted automata ⋮ Permutations, parenthesis words, and Schröder numbers ⋮ Context-free text grammars

Cites Work

• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Theory of 2-structures. II: Representation through labeled tree families
• Primitivity is hereditary for 2-structures
• Angular 2-structures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: T-structures, T-functions, and texts