yusuke1997/dblp-id-title huggingface dataset:
Language Recognition by Marking Automata
Errata: "Grammars with Partial Ordering of the Rules"
Solving Tree Problems on a Mesh-Connected Processor Array
Breakpoint distance and PQ-trees
Reduction of Permutation-Invariant Polynomials - A Noncommutative Case Study
The membership problem for subsemigroups of GL2(Z) is NP-complete
Space Filling Curves and Mathematical Programming
Quantitative classical realizability
Coinductive big-step operational semantics
Trees with exponentially growing costs
Proving Congruence of Bisimulation in Functional Programming Languages
On Various Versions of the Defective Coin Problem
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
Computing with Rewrite Systems
The Minimum Substring Cover problem
Deterministic Context-Sensitive Languages: Part I
Redundancy Elimination and Loop Checks for Logic Programs
An extension of the Lyndon-Schützenberger result to pseudoperiodic words
An Application of the Information Theory to Estimation Problems
A Domain Equation for Bisimulation
On Randomization in On-Line Computation
Seventh International Workshop on Foundations of Object-Oriented Languages
On a Question of H. Friedman
On continued fraction randomness and normality
An Upper Bound for Self-Dual Codes
Variations on U-shaped learning
Causal computational complexity of distributed processes
Deciding safety properties in infinite-state pi-calculus via behavioural types
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
Effectively Given Domains and Lambda-Calculus Models
Determined theories and limit laws
Weighted automata computation of edit distances with consolidations and fragmentations
Deciding regularity of hairpin completions of regular languages in polynomial time
Information Transmission by Electromagnetic Field
Fault tolerant network constructors
FPT approximation schemes for maximizing submodular functions
Generalizing the Paige-Tarjan algorithm by abstract interpretation
How Hard Is Computing the Edit Distance?
A self-stabilizing algorithm for edge monitoring in wireless sensor networks
Machine Induction Without Revolutionary Changes in Hypothesis Size
Rationality in Algebras with a Series Operation
Incorporating quotation and evaluation into Church's type theory
Efficient algorithms for learning functions with bounded variation
Some Properties of Disjunctive Languages on a Free Monoid
Convex Powerdomains I
Regaining cut admissibility in deduction modulo using abstract completion
Periodicity properties on partial words
Efficient representation and counting of antipower factors in words
Collision-free Robot Scheduling
Optimal Trajectory, Guidance, and Conjugate Points
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia
Computational Complexity of Arithmetical Sentences
Preservation of normality by transducers
A Note on Human Recognition of Hand-Printed Characters
Ground reducibility is EXPTIME-complete
Refining the hierarchy of blind multicounter languages and twist-closed trios
Picture codes and deciphering delay
Exact Learning Boolean Function via the Monotone Theory
A "Region" Concept and Its Application to Threshold Logic
Rule-based static analysis of network protocol implementations
State complexity of GF(2)-operations on unary languages
The Complexity of Sorting on Distributed Systems
Collision-free exploration by mobile agents using pebbles
The first fully polynomial stabilizing algorithm for BFS tree construction
Some Lower Bounds on the Number of Code Points in a Minimum Distance Binary Code. II
An Algebraic Characterization of Transition System Equivalences
A Characterization of Shannon Entropy Through Lattice Questionnaires
On the Existence of a Hamiltonian Circuit in a Graph [II]
On the relationships between models in protocol verification
Calling Names on Nameless Networks
A Note on "A Spectrum Factorization Method for the Calculation of Nonlinear Filters of the Volterra Type"
A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching
Towards a universal approach for the finite departure problem in overlay networks
Equilibria in multi-player multi-outcome infinite sequential games
An Alternative Method for Continuous Line Segment Curve-Fitting
A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases
On the Concept of State in Decentralized Control
Selected papers of the 8th International Conference on Language and Automata Theory and Applications (LATA 2014)
Two-Dimensional Packing: Expected Performance of Simple Level Algorithms
Systolic Trellis Automata: Stability, Decidability and Complexity
Erratum: "On-line Turing Machine Recognition"
A Single Recursive Predicate is Sufficient for Pure Datalog
Generalized Information Functions
Useful Information and Questionnaires
The Theory of Sequential Relations
Multiset rewriting for the verification of depth-bounded processes with name binding
Relational Interpretations of Recursive Types in an Operational Setting
Amendments to Zeiger's Cascade Synthesis of Finite-State Machines
Easy Multiplications. I. The Realm of Kleene's Theorem
Another Incompleteness Result for Hoare's Logic
On fairness and randomness
A Canonical Form of Vector Machines
Impossibility Results in the Presence of Multiple Faulty Processes
The unification problem for confluent right-ground term rewriting systems
Definability by Constant-Depth Polynomial-Size Circuits
Dependency Systems and Phrase-Structure Systems
On efficient implicit OBDD-based algorithms for maximal matchings
Revisiting Deutsch-Jozsa algorithm
Retractions on dI-domains as a model for Type:Type
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
A Statement of Editorial Policy
A Satisfiability Tester for Non-clausal Propositional Calculus
The vectorial λ-calculus
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm
A New Definition of the Entropy of General Probability Distributions Based on the Non-Standard Analysis
Characterization Theorems for a Filter Lambda Model
The Applications of Some Basic Inequalities for Entropy
The Equational Theory of Parameterized Specifications
Accepting runs in a two-way finite automaton
The Enumeration of Certain Run-Length Sequences
Synchronization of Growing Cellular Arrays
Decidable first-order transition logics for PA-processes
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Pattern-matching spi-calculus
Information Exchanged in Grasshopper Interactions
Reaching approximate Byzantine consensus with multi-hop communication
Completeness of Continuation Models for lambda-mu-Calculus
Sequentiality, Monadic Second-Order Logic and Tree Automata
Guaranteeing the Diversity of Number Generators
Decidability of the Existential Theory of Infinite Terms with Subterm Relation
Extending Planar Graph Algorithms to K_3,3-Free Graphs
Diagonal Tree Codes
Capacity of the Product of Channels
On the Regularity of Petri Net Languages
On Stability of Sixth-Order Nonlinear System
Safe typing of functional logic programs with opaque patterns and local bindings
Synthesizing structured reactive programs via deterministic tree automata
On the Output Structure of Certain Finite Automata
A black box for online approximate pattern matching
A Class of Stochastic Nonlinear Integral Equations on L^p Spaces and its Application to Optimal Control
A Class of Binary Shortened Cyclic Codes for a Compound Channel
Taming past LTL and flat counter systems
The Honest Subrecursive Classes Are a Lattice
Linear and Nonlinear Single-Error-Correcting Perfect Mixed Codes
Optimizing reachability sets in temporal graphs by delaying
Decidability of Systems of Set Constraints with Negative Constraints
On a Relation between Detection and Estimation in Decision Theory
Finite Queries Do Not Have Effective Syntax
Equivalence Problems for Mappings on Infinite Strings
Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed
Powerposets
An Exclusion Principle for Finite Memory Sequential Machines
Abstract Alphabet Distortion-Rate Functions
A Remark on Finite Transducers
A Polynomial Jump Operator
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata
Symmetry constraints on temporal order in measurement-based quantum computation
Optimal Variable Length Codes (Arbitrary Symbol Cost and Equal Code Word Probability)
Embedding as a Tool for Language Comparison
Time-bounded termination analysis for probabilistic programs with delays
On the Statistics of Random Pulse Processes
Guest Editorial: Foundations of Object-Oriented Languages
The Anaphora Problem
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition
Building a small and informative phylogenetic supertree
The Synchronization of Nonuniform Networks of Finite Automata
Unfolding-based diagnosis of systems with an evolving topology
Load balanced distributed directories
Weighted automata and logics meet computational complexity
A Context-Free Language Which is not Acceptable by a Probabilistic Automaton
A Definition of Conditional Mutual Information for Arbitrary Ensembles
Alignment-free sequence comparison using absent words
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations
Pspace-completeness of the temporal logic of sub-intervals and suffixes
Computation of Approximate Polynomial GCDs and an Extension
How Good is Morse Code?
Absent words in a sliding window with applications
Transformation of variants of Petri nets into context-dependent fusion grammars
A Note on a Computational Approximation to the Two-Machine Problem
Rule synchronization for monodirectional tissue-like P systems with channel states
Petri Net Implementations by a Universal Cell Space
Zero-Safe Nets: Comparing the Collective and Individual Token Approaches
A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars
A theory of stochastic systems part I: Stochastic automata
Incremental Concept Learning for Bounded Data Mining
Atomic cross-chain swaps with improved space, time and local time complexities
Causal Nets or What is a Deterministic Computation
Post Scriptum to "Final Note"
Structured Operational Semantics and Bisimulation as a Congruence
Fixed Interval Smoothing for Nonlinear Continuous Time Systems
Quasi-optimal energy-efficient leader election algorithms in radio networks
An Interpretation of Typed Objects into Typed pi-Calculus
Correction of Multiple Errors and Detection of Additive Overflow in Residue Code
A formalised first-order confluence proof for the -calculus using one-sorted variable names
A Proof Rule for Fair Termination of Guarded Commands
An algebraic geometric approach to Nivat's conjecture
Approximating Threshold Circuits by Rational Functions
Intersection-Closed Full AFL and the Recursively Enumerable Languages
HRELTL: A temporal logic for hybrid systems
A Combinatorial Property of Finite Prefix Codes
On the descriptional complexity of stateless deterministic ordered restarting automata
Optimal Diagnostic Questionnaires Which Allow Less than Truthful Responses
Parameterized complexity of the anchored k-core problem for directed graphs
Operational set theory and small large cardinals
Rational subsets of polycyclic monoids and valence automata
Some Notes on Finite-State Picture Languages
Green's theorem and isolation in planar graphs
Some Classes of Languages in NC¹
Deciding Full Branching Time Logic
Bounded Queries, Approximations, and the Boolean Hierarchy
On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules
A combinatorial polynomial algorithm for the linear Arrow-Debreu market
Complexity of the dynamics of reaction systems
On Some Information Measures
The generative power of delegation networks
Parallel Random Access Machines with Bounded Memory Wordsize
Perfectly Secure Key Distribution for Dynamic Conferences
Strong Normalization from Weak Normalization in Typed Lambda-Calculi
The Optimum Mean-Square Decoding of General Block Codes
Universal computably enumerable sets and initial segment prefix-free complexity
Universal Retractions on DI-Domains
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Topics in the Theory of One-Dimensional Iterative Networks
Covering space in the Weyl and Besicovitch topologies
The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources
Fixed-Point Characterization of Context-Free \infty-Languages
A Note on Mathematical Induction on Phrase Structure Grammars
Finite State Transformations
An Adaptive Network for Producing Real Functions of Binary Inputs
On Primitive Trinomials (Mode 2), II
The Power to Two-Way Deterministic Checking Stack Automata
Dynamic, First-Fit Packings in Two or More Dimensions
On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages
Pushdown module checking with imperfect information
Threshold Circuits of Small Majority-Depth
Two-Way Languages
Games, Automata, Logics, and Formal Verification (GandALF 2013)
Nonsequential Languages
Well-structured graph transformation systems
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs
On the almighty wand
Resource operators for lambda-calculus
Patterns and Pattern-Matching in Trees: An Analysis
On the Theory of Linear Dynamic System with Periodic Parameters
Indexing weighted sequences: Neat and efficient
On mobile agent verifiable problems
Temporal logics with language parameters
Space proof complexity for random 3-CNFs
Recursive coalgebras from comonads
On the Stability of a Class of Nonlinear Stochastic Systems
A Note on Entropy Metrics
Translations on a Context-Free Grammar
An axiomatization of PCTL*
Observer Theory for Continuous-Time Linear Systems
Regular Languages of Star Height One
On the Effect of the Finite Index Restriction on Several Families of Grammars
Inhabitation of Types in the Simply Typed Lambda Calculus
Fuzzy Sets and Their Operations, II
Fair multi-party contract signing using private contract signatures
Qualitative Robustness in Time Series
An Asymptotic Simultaneous Diagonalization Procedure for Pattern Recognition
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Software science view on quantum circuit algorithms
Higher-order subtyping and its decidability
Solution of a Stochastic Integral Equation Using Integral Contractors
A decidable and expressive fragment of Many-Sorted First-Order Linear Temporal Logic
Quantitative fair simulation games
Axiomatising divergence
Some Results on Singular Detection
On the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs
Look-Ahead on Pushdowns
On the Closure of AFL under Reversal
On properties not inherited by monoids from their Schützenberger groups
Languages of Encoded Line Patterns
A Note on the Determinant and Permanent Problem
Conditions for Abstract Nonlinear Regulation
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
On a definition of random sequences with respect to conditional probability
Object-oriented programming: Some history, and challenges for the next fifty years
Computing the Order of Centralizers in Linear Groups
Testing probabilistic equivalence through Reinforcement Learning
A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information
Queries on Xml streams with bounded delay and concurrency
Table design in dynamic programming
Deterministic Process Logic is Elementary
Efficient pattern matching in elastic-degenerate strings
Least Squares Filtering and Prediction of Nonstationary Sampled Data
Neural-like P systems with plasmids
On Functional Equivalences in a Model for Parallel Computation
The generalized constrained longest common subsequence in the run-length encoded format
Exclusive graph searching vs. pathwidth
Decision problems for systems of language equations and inequations
An Observational Theory for Mobile Ad Hoc Networks (full version)
Highly Parallel Computations Modulo a Number Having Only Small Prime Factors
A Generalization of the Notions of a Machine and Computability
On Stability of Solutions of Some Third and Fourth Order Delay-Differential Equations
On Policy Independence of Conditional Expectations
Bounds for online bin packing with cardinality constraints
Dependent Types with Subtyping and Late-Bound Overloading
Derandomization of quantum algorithm for triangle finding
Privacy via Subsumption
Efficient enumeration of three-state two-dimensional number-conserving cellular automata
A Method for Solving Key Equation for Decoding Goppa Codes
On Full Abstraction for PCF: I, II, and III
The Undecidability of Unification in Third Order Logic
Degrees of Dowd-Type Generic Oracles
Computational Geometry of Linear Threshold Functions
Induction by Enumeration
Distributed synthesis for parameterized temporal logics
Lifting proofs from countable to uncountable mathematics
Granularity of wagers in games and the possibility of saving
On the Syntactic Structures of Unrestricted Grammars I. Generative Grammars and Phrase Structure Grammars
Dynamic Dictionary Matching in External Memory
A scalable module system
Kripke Logical Relations and PCF
A Factor Theorem for Subsets of a Free Monoid
A model of dynamic separation for transactional memory
Transition Systems, Event Structures and Unfoldings
On omega-Regular Sets
Descriptional Complexity of Formal Systems (DCFS 2019)
Sets Accepted by One-Way Stack Automata Are Context Sensitive
Bounded MSC communication
Temporal logics with incommensurable distances are undecidable
Unraveling k-page graphs
An Analog of a Theorem about Contex-Free Languages
Tally Languages and Complexity Classes
Sparse Sets and Collapse of Complexity Classes
A Tranlsational Theorem for the Class of EOL Languages
Une Propriété des Forêts Algébriques "de Greibach"
Communications through Unspecified Additive Noise
Non computable Mandelbrot-like sets for a one-parameter complex family
Lempel-Ziv compressed structures for document retrieval
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
Representation Theorems for Equivalent Optimization Problems
Local correctability of expander codes
A Note on Probabilistic Input-Output Relations
A unifying approach to picture grammars
Exact counting of subtrees with diameter no more than d in trees: A generating function approach
Finite state incompressible infinite sequences
Entropic risk for turn-based stochastic games
A framework for compositional verification of security protocols
Closures on CPOs Form Complete Lattices
Reasoning with Time and Chance
Rejoinder to Letter by Mario C. Grignetti
A Note on Algebra and Macroscopic Observation
On Fourier Series for Gaussian Noise
Trellis Coding for Degraded Broadcast Channels
Suffixes of Addressable Data Graphs
A Note on the Noise-Widened Oscillator Spectrum
On transformations of formal power series
Automatic winning shifts
6th International Conference on Language and Automata Theory and Applications (LATA 2012)
Descriptional complexity of limited automata
On 0L-Languages
From exact sciences to life phenomena: Following Schrödinger and Turing on Programs, Life and Causality
On linear logic planning and concurrency
Higher-order interpretations and program complexity
Fast synchronization of inhomogenous random automata
A Note on the Duality of Time-Varying Decomposable Systems
Efficient Splitting and Merging Algorithms for Order Decomposable Problems
Descriptional complexity of iterated uniform finite-state transducers
Exorcising the phantom zone
Choosing the right algorithm with hints from complexity theory
Authenticated broadcast with a partially compromised public-key infrastructure
Toward A Theory of Pollard's Rho Method
A Review of "Perceptrons: An Introduction to Computational Geometry" by Marvin Minsky and Seymour Papert
Universal Profinite Domains
On the power of tree-walking automata
Relativized Perfect Zero Knowledge Is Not BPP
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines
Distributed localization of wireless sensor network using communication wheel
Continuation semantics for the Lambek-Grishin calculus
On the Coding Theorem and Its Converse for Finite-Memory Channels
Two function algebras defining functions in NC k boolean circuits
Recognition of Surfaces in Three-Dimensional Digital Images
Description Mechanics
Special issue: Selected papers of the 9th International Conference on Algebraic Informatics, CAI 2022
Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial
Multiple-Burst-Error Correction by Threshold Decoding
Conservative groupoids recognize only regular languages
Typing in Pure Type Systems
Two Thoughts on Fast Recognition of Indexed Languages
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy
Advice complexity of treasure hunt in geometric terrains
On the influence of the variable ordering for algorithmic learning using OBDDs
The Application of Difference Sets to the Design of a Balanced Multiple-Valued Filing Scheme
Bounds on the Number of Fuzzy Functions
Area-Time Optimal Division for T=Omega((log n)^1+ epsilon)
Circle Networks of Probabilistic Transducers
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)
Combined schemes for signature and encryption: The public-key and the identity-based setting
A Note on 1-Locally Linear Languages
Arithmetic Theories for Computational Complexity Problems
Partiality, Cartesian closedness and Toposes
Induction, Pure and Simple
Improved parallel construction of wavelet trees and rank/select structures
A Study in Parallel Rewriting Systems
Synchronous structures
Process semantics of general inhibitor nets
Type Reconstruction for Linear -Calculus with I/O Subtyping
Inverse monoids: Decidability and complexity of algebraic questions
Relativizations Comparing NP and Exponential Time
Detection of an Unknown Waveform Randomly Recurring in Gaussian Noise
A Partition Refinement Algorithm for the -Calculus
Geometrically closed positive varieties of languages
A Class of Definitions of "Duration" (or "Uncertainty") and the Associated Uncertainty Relations
Semantical Analysis of Specification Logic, 2
Complexity classes of equivalence problems revisited
Initial segment complexities of randomness notions
Non-normal modal logics and conditional logics: Semantic analysis and proof theory
On Learning Monotone DNF Formulae under Uniform Distributions
Information retrieval with unambiguous output
Characterizations of Monotonic and Dual Monotonic Language Learning
Boolean grammars
Measures of Information with the Branching Property over a Graph and Their Representations
Verification by Augmented Finitary Abstraction
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
Growth Functions of Stochastic Lindenmayer Systems
The Structure Generating Function of Some Families of Languages
Pure bigraphs: Structure and dynamics
Unfair Problems and Randomized Algorithms for Metrical Task Systems
Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs
Associating Parts of Patterns
Comments on a Method of Karpovsky
An Average Case Analysis of Floyd's Algorithm to Construct Heaps
Exploiting social influence to control elections based on positional scoring rules
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
A metamodel of access control for distributed environments: Applications and properties
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs