yusuke1997/dblp-id-title huggingface dataset:
On the Power of Concurrent-Write PRAMs With Read-Only Memory
Symbolic Analysis of a Decomposition of Information Processing Machines
To drive or not to drive: A logical and computational analysis of European transport regulations
Nonexistence Theorems on Perfect Lee Codes over Large Alphabets
Bisimulation and Divergence
On the limits of depth reduction at depth 3 over small finite fields
Computing the Rabin Index of a Regular Language of Infinite Words
Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time
Equations with Dyck Language Solution
Bounded Context Parsable Grammars
Operational domain theory and topology of sequential programming languages
Realizability problem for constraint LTL
The Parsing for General Phrase-Structure Grammars
Type Destructors
Existence of constants in regular splicing languages
Continuous time temporal logic with counting
The Application of Graphs to the Analysis of Distribution in Loops in a Program
New Results on the Star Problem in Trace Monoids
Arthur-Merlin streaming complexity
The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language
Approximation Algorithms for the Shortest Common Superstring Problem
Stability of a Class of Discontinuous Dynamical Systems
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
Poincare's Theorem and Uncertainty in Classical Mechanics
Some Hybrid Methods for Synchronization of Cyclic Codes
Efficient Solution to Some Problems in Free Partially Commutative Monoids
Selling two goods optimally
On Ordered Context-Free Grammars
Hitting forbidden subgraphs in graphs of bounded treewidth
Synthesis of deterministic top-down tree transducers from automatic tree relations
Interconnection Structure of Injective Counters Composed Entirely of JK Flip-Flps
Pushdown Processes: Games and Model-Checking
Note on Tape Reversal Complexity of Languages
Languages Defined with Modular Counting Quantifiers
Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol
On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces
The Complexity of Stochastic Games
Reactive automata
Hypercodes in Deterministic and Slender 0L Languages
A Relative PCF-Definability Result for Strongly Stable Functions and some Corollaries
Coinduction for preordered algebra
Reflective Star Languages and Codes
Branching-Time Temporal Logic and Tree Automata
On Trinomials x n + x 2 + 1 and x 8/±3 + x k + 1 Irreducible over GF(2)
On the Limits of Computations with the Floor Function
Needed Reduction and Spine Strategies for the Lambda Calculus
A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs
Right and Left Parses in Phrase-Structure Grammars
Variable version Lovász local lemma: A tale of two boundaries
On Completing Decoding of Linear Error-Correcting Codes
Loop-free Compositions of Certain Finite Automata
A framework for the verification of infinite-state graph transformation systems
Polynomial Time Algorithms for Sentences over Number Fields
A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes
The Combinatorics of Effective Resistances and Resistive Inverses
Compositional and symbolic synthesis of reactive controllers for multi-agent systems
Recurrent Events in a Markov Chain
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets
Positive Versions of Polynomial Time
Logic with Equality: Partisan Corroboration and Shifted Pairing
Equivalences between learning of data and probability distributions, and their applications
Most Sequences Are Stochastic
One-Way Bounded Cellular Automata
Petri Nets, Algebras, Morphisms, and Compositionality
An Easy Proof of Greibach Normal Form
Reversible pushdown transducers
The equational theory of regular words
Fault Tolerant Computing and Reliable Communication: A Unified Approach
Randomness Conservation Inequalities; Information and Independence in Mathematical Theories
A Grey-Weighted Skeleton
On the Decomposition of Cyclic Codes into Cyclic Classes
A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses
The Equivalence Problem for Real-Time Strict Deterministic Languages
Streaming k -mismatch with error correcting and applications
A Note on Approximations to Discrete Probability Distributions
On Measuring Nondeterminism in Regular Languages
The Generating Power of Total Deterministic Tree Transducers
Generalized Permutations in Convolutional Codes
Intertwined Recursion, Tree Transformations, and Linear Systems
Dynamic programming optimization in line of sight networks
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine
Weighted propositional configuration logics: A specification language for architectures with quantitative features
Membership Problems for Regular and Context-Free Trace Languages
The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata
Underapproximation for model-checking based on universal circuits
On Unary Stochastic Lindenmayer Systems
Usage Counting Analysis for Lazy Functional Languages
The lambda-context calculus (extended version)
The expressive power of the shuffle product
Scheduling Jobs Using Common Resources
Survey on mining signal temporal logic specifications
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
On the computational power of energy-constrained mobile robots
On Some Characterizations of the Shannon Entropy Using Extreme Symmetry and Block Symmetry
Membership Testing in Threshold One Transformation Monoids
Algorithms for Approximate String Matching
Mutual Information, Strong Equivalence, and Signal Sample Path Properties for Gaussian Processes
Some Universal Noiseless Multiterminal Source Coding Theorems
Contracts, Games, and Refinement
A coinductive calculus of binary trees
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems
Cost-asymmetric memory hard password hashing
Hardness and approximability of bounded access Lempel Ziv coding
Computational complexity of dynamical systems: The case of cellular automata
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications
Probabilistic judgment aggregation with conditional independence constraints
Polynomial inference of universal automata from membership and equivalence queries
Minimum fill-in: Inapproximability and almost tight lower bounds
Alternant Codes
More on Representation Theory for Default Logic
On the entropy of couplings
The Small Model Property: How Small Can It Be?
Loop-Free Compositions of Certain Finite Automata. II
Confluence Problems for Trace Rewriting Systems
Failure of a Conjecture About Context Free Languages
Kolmogorov complexity in the USSR (1975-1982): Isolation and its end
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
A Graph-Theoretic Approach to Default Logic
The Implication Problem for Functional and Inclusion Dependencies
On the state complexity of operations on two-way finite automata
Process Rewrite Systems
The Sequential Estimation and Dectection of Signals in Normal Noise. II
On teaching sets of k-threshold functions
Complementing two-way finite automata
Systematic Error on the Part of Human Links in Communication Systems
Recursion Theoretic Properties of Frequency Computation and Bounded Queries
Convergence of Entropies
Linear logical relations and observational equivalences for session-based concurrency
Breaking Goppa-based McEliece with hints
Finding the gapped longest common subsequence by incremental suffix maximum queries
Proof Lengths for Equational Completion
Cascade Synthesis of Finite-State Machines
Learning residual alternating automata
The Difference between Splitting in n and n+1
Sources Which Maximize the Choice of a Huffman Coding Tree
Reduction Algorithms for Graphs of Small Treewidth
Structural properties of NFAs and growth rates of nondeterminism measures
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
Weighted automata with storage
Canonical Representations of Chain Events
A characterization of computable analysis on unbounded domains using differential equations
On the universe, disjointness, and containment problems for simple machines
Context-free languages can be accepted with absolutely no space overhead
Natural halting probabilities, partial randomness, and zeta functions
On the Minimization of Incompletely Specified Fuzzy Functions
Plain and Covariant Multivariate Fourier Transforms
Robust Behaviorally Correct Learning
Preface to the SR-2015 special issue
A Semantics for Static Type Inference in a Nondeterministic Language
Taylor approximation for hybrid systems
Variants of codes and indecomposable languages
Turing-completeness of asynchronous non-camouflage cellular automata
The Problem of Space Invariance for Sequential Machines
Incremental Convex Planarity Testing
Some Comments on Neighborhood Size for Tessellation Automata
A Theory of Two-Dimensional Cyclic Codes
On Channels without a Capacity
Effective storage capacity of labeled graphs
Complexity Dips in Random Infinite Binary Sequences
Noisy beeping networks
Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree
Algebraic independence and blackbox identity testing
Faster Optimal Parallel Prefix Sums and List Ranking
Fuzzy and Probabilistic Uncertainty Logics
Robust simulations and significant separations
A Statistical Model for Interpreting Neuroelectric Responses
Optimal proof systems imply complete sets for promise classes
The generic combinatorial algorithm for image matching with classes of projective transformations
A New Approach of Some Problems Concerning Polynomials Over Finite Fields
Canonical mixed-polarity multi-target Toffoli circuits: Shift and removal
Overcoming Heterogeneity and Autonomy in Multidatabase Systems
A truthful near-optimal mechanism for online linear packing-covering problem in the random order model
Elastic-degenerate string comparison
Non-commutative logic III: focusing proofs
Infinite-Dimensional Filtering: The Kalman-Bucy Filter in Hilbert Space
Computation over compressed data
A Foundational Delineation of Poly-time
Optimal Control Techniques Applied to PPM Signal Design
Safe States in Banker-like Resource Allocations Problems
A Randomized Algorithm for Two Servers on the Line
The Star Height of Reset-Free Events and Strictly Locally Testable Events
On Matrix Languages
The Semantics of Second-Order Lambda Calculus
Termination of just/fair computations in term rewriting
How iterative reflections of monads are constructed
A Diagnosing Algorithm for Networks
Strategy logic
LCS approximation via embedding into locally non-repetitive strings
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
Weighted models for higher-order computation
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020)
Bisimulation for Higher-Order Process Calculi
Phylogeny- and parsimony-based haplotype inference with constraints
Bridging the gap between fair simulation and trace inclusion
Local Boundedness and the Shannon Entropy
Inductive Inference of Approximations
Selected papers from CSCML 2020, the 4th International Symposium on Cyber Security Cryptology and Machine Learning
Special Issue: TIME 2005
Editing to a connected graph of given degrees
On the Automorphism Groups of Periodic Automata
Complexity of a problem concerning reset words for Eulerian binary automata
Classification of Formal Languages by Functional Binary Transductions
Erratum, "Weight and Distance Structure of Nordstrom-Robinson Quadratic Code"
A Counterexample to the 0-1 Law for the Class of Existential Second-Order Minimal Gödel Sentences with Equality
A Remark on Discovery Algorithms for Grammars
Prelogical Relations
Bounds for Certain Cyclic AN-Codes
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
On Measures of "Useful" Information
On fast pattern formation by autonomous robots
Automata theory based on quantum logic: some characterizations
Counting Modulo Quantifiers on Finite Structures
An efficient k nearest neighbor search for multivariate time series
Proving language inclusion and equivalence by coinduction
Information gathering in ad-hoc radio networks
Maximum Period of 2-Dimensional Uniform Neural Networks
Probabilistic Verification
Optimal Hashing
ϵ-Semantics computations on biological systems
Fault-tolerant compact routing schemes for general graphs
On Ground-Confluence of Term Rewriting Systems
The Lazy Lambda Calculus in a Concurrency Scenario
The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar
The Computational Complexity of Asymptotic Problems I: Partial Orders
Some lower bounds in parameterized AC 0
4th International Workshop on Strategic Reasoning (SR 2016)
Input-Output Relations of Finite Memory Systems
No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic
A Note on the Decomposition of Cyclic Codes into Cyclic Classes
Fuzzy Events Realized by Finite Probabilistic Automata
Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers
On Primitive Trinomials (Mod 2)
Efficient construction of the BWT for repetitive text using string compression
A Trial of a New Formation of the Random Noise Model by Use of Arbitrary Uniformly Almost Periodic Functions
Learners based on transducers
Oblivious two-way finite automata: Decidability and complexity
Optimality and competitiveness of exploring polygons by mobile robots
Authenticating ad hoc networks by comparison of short digests
Characterization of Entropy of Probability Distributions on the Real Line
Generalized notions of mind change complexity
Corrigendum to "Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms" [Inf.Comput.208(3)(2010) 230-258]
One-Tape, Off-Line Turing Machine Computations
One-unambiguity of regular expressions with numeric occurrence indicators
Optimizing restriction site placement for synthetic genomes
Some Results on Quasi-Cyclic Codes
Transmission of Information in Networks of Erasure Channels
A Taxonomy of Problems with Fast Parallel Algorithms
Compositional verification of sequential programs with procedures
On Cyclic Codes Generated by Graphs
Good State Transition Policies for Nondeterministic and Stochastic Automata
Basic Paramodulation
Objects and session types
Slender Siromoney matrix languages
A Conservative Look at Operational Semantics with Variable Binding
38th International Colloquium on Automata, Languages and Programming
Automatic pre- and postconditions for partial differential equations
Restrictions of Minimum Spanner Problems
Fast polynomial inversion for post quantum QC-MDPC cryptography
Fingerprints for highly similar streams
Constant-space, constant-randomness verifiers with arbitrarily small error
The Least Squares Estimation of Linear and Nonlinear System Weighting Function Matrices
Entropy Optimization Models with Convex Constraints
A Language Element for Compression Coding
An Informational Model for Two-Person Games
Algebra of Constructions. I. The Word Problem for Partial Algebras
Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity
A semantic account of strong normalization in linear logic
Equivalence of Adult Languages and Extensions for DTOL Systems
Developments in implicit computational complexity
A General Formula for the Capacity of Stationary Nonanticipatory Channels
On Zeroing the Output of a Linear System
An Essay in Information Retrieval or The Birth of a Myth
Pathwise-randomness and models of second-order arithmetic
A Note on Preservation of Languages by Transducers
Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus
On the complexity of noncommutative polynomial factorization
On the Expressiveness of Linda Coordination Primitives
Clairvoyant state machine replication
Semilinear Codes and Some Combinatorial Applications of Them
WQO dichotomy for 3-graphs
On Finite Monoids Having Only Trivial Subgroups
Petri Nets and Szilard Languages
On the Relation between BDDs and FDDs
A Note on Cyclic Permutation Error-Correcting Codes
Optimal bounds for computing α -gapped repeats
Global Mapping Space of Cellular Systems
A Logical Study of Distributed Transition Systems
Geometric bounds for convergence rates of averaging algorithms
Clausal Logic and Logic Programming in Algebraic Domains
Induction=I-Axiomatization+First-Order Consistency
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization
Subspaces of GF(q)^w and Convolutional Codes
A mathematical theory of resources
Non-structural subtype entailment in automata theory
The Channel Capacity of the Postal Channel
Fully Abstract Semantics for Observably Sequential Languages
Some General Results of Coding Theory with Applications to the Study of Codes for the Correction of Synchronization Errors
Suboptimal Measures of Predictive Complexity for Absolute Loss Function
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
Optimal Decision Functions for Two Noise States
Minimum Label s - t Cut has large integrality gaps
Transitivity in coercive subtyping
Logarithm cartesian authentication codes
Algebra Automata II: The Categorical Framework for Dynamic Analysis
Interactions in Linear Dynamical Systems, I
Fuzzy Digital Topology
Computation over Galois Fields Using Shiftregisters
Learning by switching type of information
Characterizing contextual equivalence in calculi with passivation
Descendants and Origins in Term Rewriting
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
Adjunct elimination in Context Logic for trees
Distributed fractional local ratio and independent set approximation
An Algebraic Framework for Urgency
Minimum-Cost Transmission of Information
Normalization Results for Typeable Rewrite Systems
Detecting useless transitions in pushdown automata
Some Criteria for Determining Recognizability of a Set
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter..
An Improvement to Multifold Euclidean Geometry Codes
A Note on the Solution of a Communication Jamming Problem of Root
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting
Order-preserving pattern matching indeterminate strings
Complexity and Unambiguity of Context-Free Grammars and Languages
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
A Spectrum Factorization Method for the Calculation of Nonlinear Filters of the Volterra Type
Hypothesis spaces for learning
Semi-commutations
Correctness Proofs for Abstract Implementation
An Algebra of Behavioural Types
Building species trees from larger parts of phylogenomic databases
The Use and Usefulness of Numeration Systems
Exact algorithms for Maximum Induced Matching
The Informational Content of Mechanisms and Circuits
On the path-width of integer linear programming
Multiple Burst Error Correction
A Note on Variable Length Codes
On the complexity of some colorful problems parameterized by treewidth
Convex Powerdomains II
Cayley polynomial-time computable groups
Computing in social networks
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store
Transduction from trees to graphs through folding
Query Languages for Hierarchic Databases
Petri games: Synthesis of distributed systems with causal memory
Learning Regular Sets from Queries and Counterexamples
TOL Schemes and Control Sets
Proving termination of context-sensitive rewriting by transformation
The Complexity of Cubical Graphs
On a Class of Stochastic Processes which Are Closed under Linear Transformations
Models of active learning in group-structured state spaces
A polynomial-time algorithm for computing absolutely normal numbers
Arrow update synthesis
Polylog depth, highness and lowness for E
Synthesizing Inductive Expertise
Clusters in Digital Pictures
Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino
Type Theories, Normal Forms and D_\infty-Lambda-Models
Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models
A Transformation with Invariance Under Cyclic Permutation for Applications in Pattern Recognition
Sur Certaines Applications Séquentielles Numériques
Observations on complete sets between linear time and polynomial time
On determinism versus nondeterminism for restarting automata
Computational power of two stacks with restricted communication
Optimum Boundary Control of Distributed Parameter Systems
Algorithmic randomness and monotone complexity on product space
Expressive Completeness of Duration Calculus
Connection Management Without Retaining Information
Equivalences between Probalistic and Deterministic Sequential Machines
Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph
An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries
Control Sets on Linear Grammars
Transducer descriptions of DNA code properties and undecidability of antimorphic problems
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
Canonical Minimal Realization of a Matrix of Impulse Response Sequences
A resource semantics and abstract machine for Safe: A functional language with regions and explicit deallocation
Broadcast in the rendezvous model
Decidable metric logics
Comparing hierarchies of types in models of linear logic
Analog Perceptrons: On Additive Representation of Functions
Ordinal recursive complexity of Unordered Data Nets
Subword conditions and subword histories
The Characterization of Nonexpansive Grammars by Rational Power Series
A Remark on Tally Languages and Complexity Classes
On the Uncertainty Relation for Real Signals
A coalgebraic perspective on linear weighted automata
T0L Systems and Languages
Epimorphisms in Certain Categories of Transducers
Parameterized verification of coverability in infinite state broadcast networks
On ET0L Systems of Finite Index
Lambda Calculus with Explicit Recursion
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Regressive computations characterize logarithmic space
Towards self-stabilizing blockchain, reconstructing totally erased blockchain
Simple Translation-Invariant Concepts Are Hard to Learn
Star-Free Sets of Words on Ordinals
The Complexity of Shift Registers
Towards a proof theory for quantifier macros
Structured anaphora to quantifier domains
Special issue on the conference Theory and Applications of Models of Computation
Curves that must be retraced
Exponential lower bounds for the number of words of uniform length avoiding a pattern
Capacity and Error Bounds for a Time-Continuous Gaussian Channel
Elementary, finite and linear vN-regular cellular automata
Feasible Computability and Resource Bounded Topology
Logical vs. behavioural specifications
A modal logic internalizing normal proofs
Recovery guarantees for exemplar-based clustering
A Note on an Information Theoretic Form of The Uncertainty Principle
Bounded size dictionary compression: SC k -completeness and NC algorithms
Finite Memory Machines Satisfying the Lower Bound of Memory
Reachability of scope-bounded multistack pushdown systems
The Asymptotic Average Degree of an Augmented Polynomial
Parallel Preprocessing for Path Queries without Concurrent Reading
On Two-State Completely Isolated Probabilistic Sequential Machines
Strong and Weak Synthesis of Nonlinear Systems with Constraints on the System Space G λ