On the public citation graph
Generalized finite automata theory with an application to a decision problem of second-order logic
0 signed · 663 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.
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.
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.1002/zamm.19620420104openalex-snapshot
Beitrag zur Aerodynamik eines schwingenden Gitters II (Unterschallströmung)
inferredcites →https://doi.org/10.1002/zamm.19620420605openalex-snapshot
Beitrag zur Aerodynamik eines schwingenden Gitters III (Unterschallströmung)
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_18openalex-snapshot
Mathematische Theorie des Verhaltens endlicher Automaten
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.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0093479-4openalex-snapshot
Restricted Set-Theoretical Definitions in Arithmetic
inferredcites →https://doi.org/10.1090/s0002-9947-1961-0139530-9openalex-snapshot
Decision problems of finite automata design and related arithmetics
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0158822-2openalex-snapshot
Classes of predictably computable functions
inferredcites →https://doi.org/10.1145/320924.320931openalex-snapshot
Realization of Events by Logical Nets
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.4064/fm-47-1-57-103openalex-snapshot
The first order properties of products of algebraic systems
inferredcites →https://doi.org/10.7302/14467openalex-snapshot
Decision Problems And Definability For Generalized Arithmetic.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781444324044.ch2openalex-snapshot
Computational Complexity in Natural Language
inferred← citeshttps://doi.org/10.1006/inco.1995.1043openalex-snapshot
A Kleene Theorem for a Class of Planar Acyclic Graphs
inferred← citeshttps://doi.org/10.1006/inco.1999.2838openalex-snapshot
Sequentiality, Monadic Second-Order Logic and Tree Automata
inferred← citeshttps://doi.org/10.1006/inco.2000.2878openalex-snapshot
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
inferred← citeshttps://doi.org/10.1006/inco.2001.3077openalex-snapshot
Rationality in Algebras with a Series Operation
inferred← citeshttps://doi.org/10.1006/jcss.1996.0087openalex-snapshot
Regular Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1006/jcss.1997.1452openalex-snapshot
On the Equivalence of Recursive and Nonrecursive Datalog Programs
inferred← citeshttps://doi.org/10.1006/jcss.1997.1510openalex-snapshot
Logical Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1006/jcss.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
inferred← citeshttps://doi.org/10.1007/1-4020-3817-8_13openalex-snapshot
Algebraic classifications of regular tree languages
inferred← citeshttps://doi.org/10.1007/11422532_15openalex-snapshot
Describing Lambda Terms in Context Unification
inferred← citeshttps://doi.org/10.1007/11513988_37openalex-snapshot
Verification of Tree Updates for Optimization
inferred← citeshttps://doi.org/10.1007/11523468_4openalex-snapshot
Logics for Unranked Trees: An Overview
inferred← citeshttps://doi.org/10.1007/11523468_87openalex-snapshot
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
inferred← citeshttps://doi.org/10.1007/11538363_20openalex-snapshot
Towards a Characterization of Order-Invariant Queries over Tame Structures
inferred← citeshttps://doi.org/10.1007/11561347_6openalex-snapshot
On Domain-Specific Languages Reengineering
inferred← citeshttps://doi.org/10.1007/11601524_15openalex-snapshot
Minimizing Tree Automata for Unranked Trees
inferred← citeshttps://doi.org/10.1007/11611257_3openalex-snapshot
A Formal Comparison of Visual Web Wrapper Generators
inferred← citeshttps://doi.org/10.1007/11672142_39openalex-snapshot
Nested Pebbles and Transitive Closure
inferred← citeshttps://doi.org/10.1007/11780274_23openalex-snapshot
An Algebraic Approach to Regular Sets
inferred← citeshttps://doi.org/10.1007/11841883_5openalex-snapshot
Automata on Directed Graphs: Edge Versus Vertex Marking
inferred← citeshttps://doi.org/10.1007/11872436_21openalex-snapshot
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
inferred← citeshttps://doi.org/10.1007/11874683_11openalex-snapshot
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
inferred← citeshttps://doi.org/10.1007/11916277_2openalex-snapshot
Deciding Satisfiability of Positive Second Order Joinability Formulae
inferred← citeshttps://doi.org/10.1007/3-540-06583-0_21openalex-snapshot
Algebraic automata and optimal solutions in pattern recognition
inferred← citeshttps://doi.org/10.1007/3-540-07141-5_214openalex-snapshot
Eine Charakterisierung der Szilardsprachen und ihre Verwendung als Steuersprachen
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_213openalex-snapshot
On the analysis and synthesis problems for context-free expressions
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_228openalex-snapshot
An algebraic theory of formal languages
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_41openalex-snapshot
Rational relations of binary trees
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_175openalex-snapshot
On languages, accepted by machines in the category of sets
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_101openalex-snapshot
Relational Automata in a Category and Their Languages
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_111openalex-snapshot
The Equivalences Problems for Binary EOL-Systems are Decidable
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_75openalex-snapshot
Universal Algebras and Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_87openalex-snapshot
Recognizable and Regular Languages in a Category
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_39openalex-snapshot
On the complexity of general context-free language parsing and recognition
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_29openalex-snapshot
Parallel and two-way recognizers of directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_13openalex-snapshot
An axiomatization of regular forests in the language of algebraic theories with iteration
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_40openalex-snapshot
Some algebraic aspects of recognizability and rationality
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_49openalex-snapshot
The complexity of automata and subtheories of monadic second order arithmetics
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_43openalex-snapshot
Church-rosser transformers and decidable propertis of tree processing
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_15openalex-snapshot
Regular expressions for infinite trees and a standard form of automata
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_178openalex-snapshot
Grammars for terms and automata
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_21openalex-snapshot
Parallelism and Tree Regular Constraints
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_21openalex-snapshot
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
inferred← citeshttps://doi.org/10.1007/3-540-36285-1_22openalex-snapshot
Decidable Containment of Recursive Queries
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_7openalex-snapshot
B2M: A Semantic Based Tool for BLIF Hardware Descriptions
inferred← citeshttps://doi.org/10.1007/3-540-44503-x_2openalex-snapshot
Query Evaluation via Tree-Decompositions
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_61openalex-snapshot
On Diving in Trees Thomas Schwentick
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_31openalex-snapshot
Pomsets for Local Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_27openalex-snapshot
Decision Procedure for an Extension of WS1S
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_22openalex-snapshot
Dominance Constraints with Set Operators
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_11openalex-snapshot
The Myhill-Nerode Theorem for Recognizable Tree Series
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_22openalex-snapshot
Learning a Regular Tree Language from a Teacher
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_14openalex-snapshot
Combining Logic Programs and Monadic Second Order Logics by Program Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_30openalex-snapshot
Decidable First-Order Transition Logics for PA-Processes
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_16openalex-snapshot
On the Parallel Complexity of Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_7openalex-snapshot
Verification of Sets of Infinite State Processes Using Program Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45738-0_7openalex-snapshot
Dominance Constraints: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/3-540-45828-x_7openalex-snapshot
Time-Safety Checking for Embedded Programs
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_53openalex-snapshot
Learnability and Definability in Trees and Similar Structures
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_18openalex-snapshot
Improving the Representation of Infinite Trees to Deal with Sets of Trees
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_22openalex-snapshot
Predicate Logic and Tree Automata with Tests
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_8openalex-snapshot
Automating Modular Verification
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_22openalex-snapshot
Decidable Fragments of Simultaneous Rigid Reachability
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_27openalex-snapshot
On the Connections between Rewriting and Formal Language Theory
inferred← citeshttps://doi.org/10.1007/3-540-48975-4_6openalex-snapshot
The MSO Logic-Automaton Connection in Linguistics
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_2openalex-snapshot
A Decidable Logic for Describing Linked Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_74openalex-snapshot
Generalized definite tree languages
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_91openalex-snapshot
Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_161openalex-snapshot
Finding minimal forbidden minors using a finite congruence
inferred← citeshttps://doi.org/10.1007/3-540-54487-9_49openalex-snapshot
Monadic second order logic, tree automata and forbidden minors
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_2openalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_15openalex-snapshot
Modulo counting quantifiers over finite trees
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_71openalex-snapshot
On reverse and general definite tree languages
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_76openalex-snapshot
Feature automata and recognizable sets of feature trees
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_34openalex-snapshot
Regular tree languages without unary symbols are star-free
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_116openalex-snapshot
Nontraditional applications of automata theory
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_29openalex-snapshot
Logical specifications of infinite computations
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_25openalex-snapshot
Recent methods for RNA modeling using stochastic context-free grammars
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_21openalex-snapshot
The notion of rank and games
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_88openalex-snapshot
MSO definable text languages
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_191openalex-snapshot
Specifying timed state sequences in powerful decidable logics and timed automata
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_71openalex-snapshot
Regular substitution sets: A means of controlling E-unification
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_191openalex-snapshot
First-order logic on finite trees
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_110openalex-snapshot
Decomposable structures, Boolean function representations, and optimization
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_106openalex-snapshot
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_56openalex-snapshot
Mona: Decidable arithmetic in practice
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_2openalex-snapshot
Decidable call by need computations in term rewriting (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_41openalex-snapshot
Symbolic model checking with rich assertional languages
inferred← citeshttps://doi.org/10.1007/3-540-63246-8_9openalex-snapshot
Monadic second order logic and node relations on graphs and trees
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_52openalex-snapshot
The undecidability of simultaneous rigid E-unification with two variables
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_29openalex-snapshot
Regular n-ary Queries in Trees and Variable Independence
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_1244openalex-snapshot
Parameterized Complexity of Queries
inferred← citeshttps://doi.org/10.1007/978-1-4471-3564-7_8openalex-snapshot
Ordered Types in the AQUA Data Model
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_16openalex-snapshot
Partial Automata and Finitely Generated Congruences: An Extension of Nerode’s Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_1244openalex-snapshot
Parameterized Complexity of Queries
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_9openalex-snapshot
Optimization of Synchronous Circuits
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_1244-2openalex-snapshot
Parameterized Complexity of Queries
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_2openalex-snapshot
Theoretical Computer Science: Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_20openalex-snapshot
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_20openalex-snapshot
Logic and Rational Languages of Scattered and Countable Series-Parallel Posets
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_12openalex-snapshot
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_18openalex-snapshot
Automata Terms in a Lazy WSkS Decision Procedure
inferred← citeshttps://doi.org/10.1007/978-3-030-90636-8_6openalex-snapshot
Specification and Safety Verification of Parametric Hierarchical Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_18openalex-snapshot
Weighted Tree Automata with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_13openalex-snapshot
Reasoning About Data Trees Using CHCs
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_19openalex-snapshot
Monadic Monadic Second Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_3openalex-snapshot
Twin-Treewidth: A Single-Exponential Logic-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_30openalex-snapshot
The Weighted HOM-Problem Over Fields
inferred← citeshttps://doi.org/10.1007/978-3-031-66159-4_5openalex-snapshot
Logic and Languages of Higher-Dimensional Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_1openalex-snapshot
Context-Free Languages of String Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_12openalex-snapshot
Shape Preserving Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-04939-7_13openalex-snapshot
View-Based Tree-Language Rewritings for XML
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_47openalex-snapshot
Automating Separation Logic with Trees and Data
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_13openalex-snapshot
Logics for Unordered Trees with Data Constraints on Siblings
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_13openalex-snapshot
A Logical Characterization of Timed Pushdown Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_8openalex-snapshot
Capturing MSO with One Quantifier
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_2openalex-snapshot
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data
inferred← citeshttps://doi.org/10.1007/978-3-319-56841-6_6openalex-snapshot
Formal Reasoning on Infinite Data Values: An Ongoing Quest
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_39openalex-snapshot
Projection for Büchi Tree Automata with Constraints Between Siblings
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_17openalex-snapshot
On Logically Defined Recognizable Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_8openalex-snapshot
Querying Unranked Trees with Stepwise Tree Automata
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-28644-8_9openalex-snapshot
Characterizing EF and EX Tree Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_9openalex-snapshot
Learning Node Selecting Tree Transducer from Completely Annotated Examples
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_27openalex-snapshot
Regular Tree Languages Definable in FO
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_36openalex-snapshot
Automata and Logics for Unranked and Unordered Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_36openalex-snapshot
Kleene’s Theorem for Weighted Tree-Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_16openalex-snapshot
Tree Schemata and Fair Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_33openalex-snapshot
A Kleene Iteration for Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-69912-5_6openalex-snapshot
Solving Proportional Analogies by E–Generalization
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_15openalex-snapshot
Logics and Automata for Totally Ordered Trees
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-540-73420-8_78openalex-snapshot
Model Theory Makes Formulas Large
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_30openalex-snapshot
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_21openalex-snapshot
Tree Automata over Infinite Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_49openalex-snapshot
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_25openalex-snapshot
Tree Automata with Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_39openalex-snapshot
Construction of Tree Automata from Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_30openalex-snapshot
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-89408-7_15openalex-snapshot
Scope Underspecification with Tree Descriptions: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_61openalex-snapshot
A Kleene Theorem for Forest Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_9openalex-snapshot
Weighted Tree Automata and Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-02424-5_7openalex-snapshot
Pomset Languages of Finite Step Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_13openalex-snapshot
Compact Representation for Answer Sets of n-ary Regular Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_12openalex-snapshot
Context-Free Languages of Countable Words
inferred← citeshttps://doi.org/10.1007/978-3-642-03793-1_4openalex-snapshot
XML Security Views Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_23openalex-snapshot
Combining Theories with Shared Set Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_6openalex-snapshot
Building a Calculus of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_14openalex-snapshot
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_30openalex-snapshot
Regular Hedge Language Factorization Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_7openalex-snapshot
Algorithmic Properties of Millstream Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_13openalex-snapshot
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_5openalex-snapshot
Ordered Sets in the Calculus of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_16openalex-snapshot
Variable Tree Automata over Infinite Ranked Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_24openalex-snapshot
Fly-Automata, Their Properties and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_36openalex-snapshot
An Efficient Decision Procedure for Imperative Tree Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_6openalex-snapshot
Exploiting Bounded Treewidth with Datalog (A Survey)
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_2openalex-snapshot
Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-28472-4_2openalex-snapshot
Foundations of XML Based on Logic and Automata: A Snapshot
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_9openalex-snapshot
Cellular Automata on Regular Rooted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-37509-5_3openalex-snapshot
Probabilistic XML: Models and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-60207-8_7openalex-snapshot
Tree-Walking Pebble Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-67740-3_7openalex-snapshot
Recent Developments in Digital Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_7openalex-snapshot
Monadic Second-Order Logic and Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_34openalex-snapshot
Containment of Monadic Datalog Programs via Bounded Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_5openalex-snapshot
Provenance Circuits for Trees and Treelike Instances
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.1007/978-3-662-53132-7_30openalex-snapshot
On Finite and Polynomial Ambiguity of Weighted Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-81-322-1812-8_44-1openalex-snapshot
Terms and Automata Through Logic
inferred← citeshttps://doi.org/10.1007/978-81-322-2577-5_44openalex-snapshot
Terms and Automata Through Logic
inferred← citeshttps://doi.org/10.1007/978-90-481-3331-4_13openalex-snapshot
Regular Query Techniques for XML-Documents
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_10openalex-snapshot
Features in Phonological Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_17openalex-snapshot
Proof Theory and Formal Grammars: Applications of Normalization
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_19openalex-snapshot
Synchrony and Composition: Toward a Cognitive Architecture between Classicism and Connectionism
inferred← citeshttps://doi.org/10.1007/978-981-13-3083-4_11openalex-snapshot
TencentFmRD Neural Machine Translation System
showing the first 200 of 648 · page through all 648
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.