MSO definable text languages

DOI10.1007/3-540-58338-6_88zbMath1493.68189OpenAlexW1517877500MaRDI QIDQ5096900

Paulien ten Pas, Hendrik Jan Hoogeboom

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_88

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Higher-order logic (03B16)

Related Items

The monadic second-order logic of graphs. X: Linear orderings

Cites Work

• T-structures, T-functions, and texts
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• A regular characterization of graph languages definable in monadic second-order logic
• Context-free text grammars
• Tree acceptors and some of their applications
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Weak Second‐Order Arithmetic and Finite Automata
• Combinatorial properties of texts
• Algebraic automata and context-free sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item