yusuke1997/dblp-id-title huggingface dataset:
Online recognition of dictionary with one gap
Imperfect information in Reactive Modules games
Coding Theory and the Mathieu Groups
Sampling Principle for Continuous Signals with Time-Varying Bands
Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
Complexity bounds for container functors and comonads
Compressed property suffix trees
Multiple Mutual Informations and Multiple Interactions in Frequency Data
Commutation-augmented pregroup grammars and push-down automata with cancellation
Reasoning about Networks with Many Identical Finite State Processes
Final coalgebras for functors on measurable spaces
Weight-reducing Turing machines
On Constructing Group Codes
A Computer Implementation of a Bayesian Analysis of Image Reconstruction
A Method of Analysis of Discrete Communication Feedback Systems
Solutions and query rewriting in data exchange
The Undecidability of the Third Order Dyadic Unification Problem
Ensuring termination by typability
Binary constraint satisfaction problems defined by excluded topological minors
A Generalization of the Sampling Theorem
Precircular Codes and Periodic Biinfinite Words
Embedded Pronoun Reference
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]
7th International Conference on Language and Automata Theory and Applications (LATA 2013)
Synthesis in presence of dynamic links
Experiments on Computer Recognition of Connected Handwritten Words
Absolute convergence of rational series is semi-decidable
Observability of Nonlinear Systems
Some Remarks on State Grammars and Matrix Grammars
Linear, Stationary, Optimal Feedback Control Systems
Relational Properties of Domains
Enumeration of two dimensional palindromes
A general SOS theory for the specification of probabilistic transition systems
Parameter synthesis of polynomial dynamical systems
Coping with selfish on-going behaviors
Truthful approximation for rank-maximal matchings
Type Inference for Polymorphic References
A Note on Phrase Structure Grammars
A Feedback Near-Optimum Control for Nonlinear Systems
Topological extension of parity automata
A Note on Petri Net Languages
Graded modalities in Strategy Logic
The Theoretical Channel Capacity of a Single Neuron as Determined by Various Coding Systems
Weakly useful sequences
Fast gapped variants for Lempel-Ziv-Welch compression
A Formal Notion of Program-Based Test Data Adequacy
A Worst-Case Analysis of the LZ2 Compression Algorithm
Complexity of universality and related problems for partially ordered NFAs
Synchronous t -resilient consensus in arbitrary graphs
Two-Dimensional Multipass On-Line Tessellation Acceptors
Unary Multiple Equality Sets: The Languages of Rational Matrices
Complexity and Expressive Power of Deterministic Semantics for DATALOG¬
Synchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293)
Undecidable Questions about the Maximum Invariant Set
Term rewriting for normalization by evaluation
Fail-Safe Realization of Sequential Machines
Asymptotic behavior of the numbers of runs and microruns
The Decidability of Equivalence for Determistic Stateless Pushdown Automata
Quantifying information leakage in process calculi
Testing Equivalence for Mobile Processes
Preface to Special Issue: EXPRESS/SOS 2018
Space-Bounded Complexity Classes and Iterated Deterministic Substitution
Abstract processes in the absence of conflicts in general place/transition systems
The Theory of Interacting Local Automata
On omega-Sets Associated with Context-Free Languages
The expectation monad in quantum foundations
On the Efficiency of a New Method of Dictionary Construction
On store languages and applications
Looping vs. Repeating in Dynamic Logic
The Recognition of Deterministic CFL's in Small Time and Space
On the Jacopini Technique
Polynomial certificates for propositional classes
Note on Reinforcing Control Information in Variable Length Items
Associate Languages and Derivational Complexity of Formal Grammars and Languages
A Lower Bound for the Worst Case of Bottom-Up-Heapsort
A Maximal Monoidal Closed Category of Distributive Algebraic Domains
Best of two local models: Centralized local and distributed local algorithms
Adaptive Modeling of Time Variable Systems
Final Note on a Class of Skew Distribution Functions: Analysis and Critique of a Mode Due to H. A. Simon
Synchronizing deterministic push-down automata can be really hard
Recognition Time of Context-Free Languages by On-Line Turing Machines
Bialgebraic foundations for the operational semantics of string diagrams
Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets
Turing Machines With Access to History
Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata
Cap Expressions for Context-Free Languages
Tolerating a Linear Number of Faults in Networks of Bounded Degree
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth
Paradoxes Related to the Rate of Transmission of Information
An Acquirable Code
"(ν, κ, λ) Configurations and Self-Dual Codes"
Transformational Classes of Grammars
Temporal logics over linear time domains are in PSPACE
Position discovery for a system of bouncing robots
Full Abstraction in the Lazy Lambda Calculus
A Note on Entropy of Telugu Prose
A Relationship between the Cascaded Network and the Two-Layer Network of Threshold Logic Units
Counting (Watson-Crick) palindromes in Watson-Crick conjugates
On Confluent Semi-commutations: Decidability and Complexity Results
P, NP and the Post Correspondence Problem
A Logic of Recursion
Language Types and Logical Theorems
An Approach to Estimation and Extrapolation with Possible Applications in an Incompletely Specified Environment
On the Synthesis of Generators of Stable Probability Distributions
A Characterization of Codes Meeting the Griesmer Bound
A modular and parameterized presentation of pregroup calculus
Some Results on the Generalized Star-Height Problem
A Note on the Determination of a Discrete Probability Distribution from Known Marginals
Two- and Three-Dimensional Firing-Squad Synchronization Problems
An algebraic approach to data languages and timed languages
A Statistical Method of Spelling Correction
A Lower Bound for the Integer Element Distinctness Problem
Bisimilarity of Open Terms
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
Parallel Context-Free Languages
On Linear and Nonlinear Single-Error-Correcting q-nary Perfect Codes
Algebraically Punctured Cyclic Codes
The Unwind Property in Certain Algebras
Loop Circuits and Their Relation to Razborov's Approximation Model
The Bounds of Skolem Functions and Their Applications
Bisimilarity in Term Graph Rewriting
Classes of languages generated by the Kleene star of a word
Information Processing for Observed Jump Processes
Tight lower bounds for certain parameterized NP-hard problems
Type-Safe Covariant Specialization with Generalized Matching
The Banker's Problem with Precedences
Likelihood Functions for Stochastic Signals in White Noise
Decidability of Bisimilarity for One-Counter Processes
On the complexity of minimizing probabilistic and quantum automata
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
Decomposition and Convergence of Likelihood Ratios
Isomorphism of Graphs Which are Pairwise k-separable
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs
A Finite Equational Axiomatization of the Functional Algebras for the Lambda Calculus
One-way reversible and quantum finite automata with advice
A Resource-Based Prioritized Bisimulation for Real-Time Systems
Denotational Semantics of a Parallel Object-Oriented Language
Information Transmission in One-Dimensional Cellular Space and the Maximum Invariant Set
WQO is decidable for factorial languages
Some Remarks on Computing the Square Parts of Integers
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Geodesics in Digital Pictures
Asynchronous Mappings and Asynchronous Cellular Automata
Secretive interaction
Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
Measurement, Theory, and Information
Recognition and Parsing of Context-Free Languages in Time n^3
On the Definition of a Family of Automata
Ultimate approximation and its application in nonmonotonic knowledge representation systems
How Robust Is The n-Cube?
On Vote-Taking and Complete Decoding of Certain Error-Correcting Codes
The Lazy Bureaucrat scheduling problem
Three-Dimensional Digital Topology
Quantitative verification of implantable cardiac pacemakers over hybrid heart models
On Basic Properties of DOS Systems and Languages
Leanest quasi-orderings
Learning in Friedberg numberings
Subshifts as models for MSO logic
Reversible Codes
Tight bounds for FEC-based reliable multicast
Quiescence, Fairness, Testing, and the Notion of Implementation
Learning secrets interactively. Dynamic modeling in inductive inference
Reversibility of computations in graph-walking automata
A New Solution for the Byzantine Generals Problem
The uniform measure of simple regular sets of infinite trees
The quest for minimal quotients for probabilistic and Markov automata
When unlearning helps
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
The Ant-Lion Paradigm for Strong Normalization
Sequential aggregate signatures with lazy verification from trapdoor permutations
On the Number of Sides Necessary for Polygonal Approximation of Black-and-White Figures in the Plane
A New Construction of Group and Nongroup Perfect Codes
On the freeze quantifier in Constraint LTL: Decidability and complexity
On the Periodicity of Regular Languages
Determination of Capacity Achieving Input Probabilities for a Class of Finite State Channels with Side Information
Indecomposable Channels with Side Information at the Transmitter
Full Abstraction for a Shared-Variable Parallel Language
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence
An Incompleteness Theorem for One-Dimensional Binary Cellular Acceptors
Codes over Integer Residue Rings
Simple Consequence Relations
Group Axioms for Iteration
Simple Self-Reproducing Universal Automata
Corrigendum: "Comment on an Algorithm that Generates Fuzzy Prime Implicants by Lee and Chang"
Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect
Short proofs of the Kneser-Lovász coloring principle
A Note on the Applicaton of Graph Theory to Digital Computer Programming
The complexity of data aggregation in static and dynamic wireless sensor networks
Detection of a Coherent Signal of Known Phase
Variations on extending partially defined Boolean functions with missing bits
Polymatroidal Dependence Structure of a Set of Random Variables
On finite alphabets and infinite bases
Towards non-iterative calculation of the zeros of the Riemann zeta function
Efficient and competitive broadcast in multi-channel radio networks
Nonsupervised Adaptive Signal Detection and Pattern Recognition
A Unifying Theorem for Algebraic Semantics and Dynamic Logics
Language Identification in the Limit
The Information of Nonsequential Messages
Exact bounds for acyclic higher-order recursion schemes
On the automatizability of resolution and related propositional proof systems
Comparative Semantics for Flow of Control in Logic Programming without Logic
On tightness of Tsaknakis-Spirakis descent methods for approximate Nash equilibria
On the Decidability of Some Equivalence Problems for D0L-Systems
Ordered Catenation and Regular Free Disjunctive Languages
Finite State Predictors for Gaussian Sequences
A Formal Theory of Inductive Inference. Part I
On the Uncertainty Relation for Real Signals: Postscript
Locally Linear Families of Languages
New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries
Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case
Eilenberg-Moore algebras for stochastic relations
A Mixed Theory of Information. III. Inset Entropies of Degree Beta
Maximal state complexity and generalized de Bruijn words
Relative approximate bisimulations for fuzzy picture automata
Finite Automata Having Cost Functions
A combinatorial characterization of self-stabilizing population protocols
Web Automata
Double-ended palindromic trees in linear time
The Bounded Degree Problem for eNCE Graph Grammars
On the containment problem for deterministic multicounter machine models
On Computations with Pulses
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class
Multi-parameterised compositional verification of safety properties
A Normal Form Problem for Unlabeled Boundary NLC Graph Languages
Characterising spectra of equivalences for event structures, logically
Pseudo-Extending Computable Functions
A simple and deterministic competitive algorithm for online facility location
Mixed choice in session types
On the power of finite ambiguity in Büchi complementation
Some Memory Characteristics of Incompletely Specified Sequential Machines
Infinite Trees, Markings and Well-Foundedness
Computational complexity of the problem of tree generation under fine-grained access control policies
Safety by Uninterpreted Locks
Unification Algorithms Cannot Be Combined in Polynomial Time
A computational model for multi-variable differential calculus
Statistical Properties of a Linear Stochastic System
Restricted space algorithms for isomorphism on bounded treewidth graphs
The Dimension of Stability of Stochastic Automata
Decomposition of Synchronous Sequential Machines into Synchronous and Asynchronous Submachines
A Note on Probabilistic Grammars
Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions
The expressive Power of Finitely Many Generalized Quantifiers
Generalizations of the BCH Bound
Disjunctive Languages On a Free Monoid
On the Non-Existence of Perfect Double Hamming-Error-Correcting Codes on q = 8 and q = 9 Symbols
Learnability and positive equivalence relations
Fourier Transform over Finite Groups for Error Detection and Error Correction in Computation Channels
Context-Dependent L Forms
Read-Twice DNF Formulas are Properly Learnable
The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers
Levels of undecidability in rewriting
A Quick Construction of a Retraction of All Retractions for Stable Bifinites
Generalizations of Regular Events
A Finite State Probabilistic Automaton that Accepts a Context Sensitive Language that is Not Context Free
Unranked second-order anti-unification
Computation by interaction for space-bounded functional programming
Asynchronous sequential processes
Two Remarks to Noiseless Coding
An Algebraic Model of Synchronous Systems
Generalized Global Sensitivity and Correlation Analysis
Duality for Linear Systems over Rings
Optimal Parallel Pattern Matching in Strings
Redundancy and Complexity of Logical Elements
The Weight Enumerators for Certain Subcodes of the Second Order Binary Reed-Muller Codes
A Denotational Semantics of Inheritance and Its Correctness
Two-Way Pushdown Automata
String matching with up to k swaps and mismatches
A Convenient Cryptomorphic Version of Recursive Function Theory
Transduction rationnelle, substitution et complémentaire
Apple Tasting
Entropy of regular timed languages
How to Compute the Minimum Distance for Cyclic AN-Codes over an Arbitrary Base. I. Elementary Methods
Translation of resolution proofs into short first-order proofs without choice axioms
Dynamics of reputation in mobile agents systems and weighted timed automata
26th Workshop on Logic, Language, Information and Computation - WoLLIC 2019
A Communication-Randomness Tradeoff for Two-Processor Systems
Polylog Depth Circuits for Integer Factoring and Discrete Logarithms
Towards a unified approach to encodability and separation results for process calculi
Design of File Organization Schemes for Selected Query Set on Binary-Valued Attributes and Their Redundancies
A Coding Theorem for Abstract Memoryless Channels
Channel Distances and Representation
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus
Pair Algebra and Its Application to Automata Theory
A Class of Low-Rate Nonlinear Binary Codes
First-order μ -calculus over generic transition systems and applications to the situation calculus
Combinatorial Multiple-Valued Filing Systems for Multiattribute Queries
Deadlock analysis of unbounded process networks
The General Uncertainty Relation for Real Signals in Communication Theory
A Region Crossing Problem for Array-Bounded Automata
Some Applications of a Theorem of Shirshov to Language Theory
On the Rate Distortion Function of a Memoryless Gaussian Vector Source Whose Components Have Fixed Variances
19th International Conference on Automated Deduction (CADE-19)
Decision Trees: Old and New Results
The most nonelementary theory
Typing termination in a higher-order concurrent imperative language
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
Reducing the number of disjuncts in DTPs
Using String Languages to Describe Picture Languages
Learning languages from positive data and a finite number of queries
Ring exploration with myopic luminous robots
Algebraic barriers to halving algorithmic information quantities in correlated strings
On the Quantization of Finite Dimensional Messages
Constrained existence problem for weak subgame perfect equilibria with ω -regular Boolean objectives
A Note on Noncontext-Free Rational Stochastic Languages
Stability and Computability in Coherent Domains
Type inference for record concatenation and subtyping
Time and Tape Complexity of Pushdown Automaton Languages
Tri-weight Codes and Generalized Hadamard Matrices
Identification of Linear Dynamic Systems
Fast congruence closure and extensions
The Calculus of Signal Flow Diagrams I: Linear relations on streams
Polymorphic Rewriting Conserves Algebraic Confluence
Rational and Recognizable Complex Trace Languages
Regular sets of infinite message sequence charts
Formative Processes with Applications to the Decision Problem in Set Theory, I. Powerset and Singleton Operators
A theory of system behaviour in the presence of node and link failure
A Note on the Iterative Decomposition of Finite Automata
On reducing linearizability to state reachability
Online selection of intervals and t-intervals
The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal
Undecidability of asynchronous session subtyping
Synchronizing automata with finitely many minimal synchronizing words
Bounding the dimension of points on a line
Quorum Systems Constructed from Combinatorial Designs
Bisimulation metrics and norms for real-weighted automata
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes
Match-bounds revisited
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas
Tree Transducers and Tree Languages
On Schematological Equivalence of Partially Interpreted Dataflow Networks
The impossibility of boosting distributed service resilience
Some connections between bounded query classes and non-uniform complexity
Solving mean-payoff games via quasi dominions
Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations
On the round complexity of Byzantine agreement without initial set-up
A Note on Recurrent Words
Special issue on structural operational semantics
Semantics of Temporal Classes
A dichotomy result for countably based sober spaces
Generalised entropies and asymptotic complexities of languages
A Theory of Primitive Objects: Untyped and First-Order Systems
Syntactic Type Soundness Results for the Region Calculus
On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
Equivalence of NC^k and AC^k-1 closures of NP and Other Classes
Learning Strategies
On the Power of DNA-Computing
Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement
Weight and Distance Structure of Nordstrom-Robinson Quadratic Code
Weighted automata and weighted MSO logics for average and long-time behaviors
Iteration Theories of Synchronization Trees
Language models for some extensions of the Lambek calculus
On the Toggle Register Polynomial
Matrix Grammars with a Leftmost Restriction
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs
Dynamic nested brackets
A Sampling Theorem for Duration-Limited Functions with Error Estimates
Bounding messages for free in security protocols - extension to various security properties
Online Variable Sized Covering
Smoothed model checking for uncertain Continuous-Time Markov Chains
Iterated a-NGSM Maps and \Gamma Systems
Inclusion dynamics hybrid automata
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
The Complexity of Word Problems - This Time with Interleaving
The Complexity of Propositional Linear Temporal Logics in Simple Cases
On Static Logics, Dynamic Logics, and Complexity Classes
Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan
Semantic Confluence Tests and Completion Methods
Mathematical Foundations of Interconnected J-K Flip-Flops
The Sardinas/Patterson and Levenshtein Theorem
The OI-Hierarchy Is Closed under Control
Rational subsets and submonoids of wreath products
Negative Radix Transformation Algorithms and a Sequential Logic Machine for Bidirectional Binary Implementation
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c
A Note on the Mean Square Weight for Group Codes
Any Lifting of a Trace Coding is a Word Coding
Topology recognition with advice
Multicoloring trees
On Deterministic Indexed Languages
The Vertex Separation and Search Number of a Graph
Local higher-order fixpoint iteration
Improved time bounds for linearizable implementations of abstract data types
A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables
Majority Logic Decodable Codes Derived from Finite Inversive Planes
Hybrid logical analyses of the ambient calculus
Bialgebraic methods and modal logic in structural operational semantics
Polynomial Size Omega-Branching Programs and Their Computational Power
The Effect of Sequential Decision Feedback on Communication over the Gaussian Channel
On persistent reachability in Petri nets
On the Equivalence Problem for Attribute Systems
Combination of roots and boolean operations: An application to state complexity
Encoding of Unifilar Renewal Sources
Theory of Interevent Interval Distributions for Stationary Point Processes
On a Coding Theorem Connected with Rényi's Entropy
Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria
Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts
How many strings are easy to predict?
Compact Recognizers of Episode Sequences
Probabilistic Logical Characterization
Bisimulation Equivalence is Decidable for All Context-Free Processes
Erratum: "Generalized Transition Matrix of a Sequential Machine and Its Applications"
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
Note on the Complement of a (Minimal) Linear Language
A thread calculus with molecular dynamics
Name-passing calculi: From fusions to preorders and types
Minimal-Program Complexity of Sequences with Restricted Resources
A stable programming language
A New Type of Computer for Problems in Propositional Logic, with Greatly Reduced Scanning Procedures
Total (restrained) domination in unit disk graphs
Complexity-style resources in cryptography