On the public citation graph

Monadic Second-Order Definable Text Languages

https://doi.org/10.1007/bf02679464
0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/3-540-57163-9_34openalex-snapshot
Regular tree languages without unary symbols are star-free
inferredcites →https://doi.org/10.1007/3-540-58338-6_88openalex-snapshot
MSO definable text languages
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bf01192159openalex-snapshot
Context-free text grammars
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(90)90129-6openalex-snapshot
Theory of 2-structures, part I: Clans, basic subclasses, and morphisms
inferredcites →https://doi.org/10.1016/0304-3975(90)90130-aopenalex-snapshot
Theory of 2-structures, part II: Representation through labeled tree families
inferredcites →https://doi.org/10.1016/0304-3975(91)90078-gopenalex-snapshot
A regular characterization of graph languages definable in monadic second-order logic
inferredcites →https://doi.org/10.1016/0304-3975(91)90387-hopenalex-snapshot
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
inferredcites →https://doi.org/10.1016/0304-3975(93)90323-lopenalex-snapshot
T-structures, T-functions, and texts
inferredcites →https://doi.org/10.1016/0304-3975(94)00272-xopenalex-snapshot
Characterization and complexity of uniformly nonprimitive labeled 2-structures
inferredcites →https://doi.org/10.1016/0304-3975(94)90268-2openalex-snapshot
Monadic second-order definable graph transductions: a survey
inferredcites →https://doi.org/10.1016/0304-3975(95)00083-6openalex-snapshot
The monadic second-order logic of graphs X: Linear orderings
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1051/ita/1993270504331openalex-snapshot
Combinatorial properties of texts
inferredcites →https://doi.org/10.3233/fi-1996-253409openalex-snapshot
TEXT LANGUAGES IN AN ALGEBRAIC FRAMEWORK

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-46011-x_17openalex-snapshot
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_18openalex-snapshot
Automata on Series-Parallel Biposets
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_8openalex-snapshot
Algebraic Recognizability of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_31openalex-snapshot
Definable Transductions and Weighted Logics for Texts
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_13openalex-snapshot
Logic and Branching Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_15openalex-snapshot
Weighted Automata and Logics on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_13openalex-snapshot
Weighted Automata and Logics on Infinite Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.018openalex-snapshot
The recognizability of sets of graphs is a robust property
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.11.028openalex-snapshot
Axiomatizing the identities of binoid languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.019openalex-snapshot
Existential MSO over two successors is strictly weaker than over linear orders
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.040openalex-snapshot
Definable transductions and weighted logics for texts
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.014openalex-snapshot
Multiple context-free tree grammars: Lexicalization and characterization
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00370-5openalex-snapshot
Towards a language theory for infinite N-free pomsets
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.2168/lmcs-6(1:5)2010openalex-snapshot
Weighted Logics for Nested Words and Algebraic Formal Power Series
inferred← citeshttps://doi.org/10.7146/brics.v9i44.21759openalex-snapshot
Higher Dimensional Automata
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.