yusuke1997/dblp-id-title huggingface dataset:
A Simple Proof of the Decipherability Criterion of Sardinas and Patterson
Performance of Heuristic Bin Packing Algorithms with Segments of Random Length
Practical verification of multi-agent systems against Slk specifications
Constructive linear-time temporal logic: Proof systems and Kripke semantics
Structured Turing Machines
Letter Recognition and the Segmentation of Running Text
Completeness Results for Single-Path Petri Nets
Computation with Finite Fields
Minimizing deterministic weighted tree automata
Schnorr randomness for noncomputable measures
Traceable constant-size multi-authority credentials
The Church-Rosser theorem and quantitative analysis of witnesses
Erratum: "Generalized Decomposition of Incomplete Finite Automata"
Uniform Self-Stabilizing Ring Orientation
H-Bounded and Semi-discrete Languages
A classification of the expressive power of well-structured transition systems
Towards a Foundation for Semantics in Complete Metric Spaces
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
Inclusion Relations Among Families Of Context-Free Languages
Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Unavoidable Sets of Words of Uniform Length
Linear programming of monitoring the links of a fractional weighted network using distance
Depth-3 circuits for inner product
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
Inevitable Experimental Errors, Determinism, and Information Theory
The Design of Nonlinear Filters and Control Systems. Part I
On the value of variables
Languages albébriques dominés par des langages unaires
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
Forward and Backward Simulations: I. Untimed Systems
Ordinal theory for expressiveness of well-structured transition systems
Why Tricategories?
Testing Language Containment for omega-Automata Using BDD's
Semantics of Nondeterministic Asynchronous Broadcast Networks
A Higher-Order Calculus and Theory Abstraction
Structural operational semantics for stochastic and weighted transition systems
Simulating perfect channels with probabilistic lossy channels
Special Issue: Selected papers of the 14th International Conference on Language and Automata Theory and Applications, LATA 2020
Decisiveness of stochastic systems and its application to hybrid models
Restrictions on Weight Distribution of Reed-Muller Codes
A Note on Complexity Measures for Inductive Classes in Constructive Type Theory
The Regulator Theory for Finite Automata
CPO Models for Compact GSOS Languages
Lower bounds on systolic gossip
New Parametric Measures of Information
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II
A Remark on Incompletely Specified Automata
Further remarks on DNA overlap assembly
The Pursuit of Deadlock freedom
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Bounded hairpin completion
The Loop Complexity of Pure-Group Events
A self-stabilizing Hashed Patricia Trie
Functional Schemas with Nested Predicates
A Mathematical Investigation of Propagating Graph 0L Systems
Type Inference for Variant Object Types
Iterated Stack Automata and Complexity Classes
Deterministic algorithms for the hidden subgroup problem
Membership Testing in Commutative Transformation Semigroups
Reduction of Feedback Loops in Sequential Circuits and Carry Leads in Iterative Networks
Codes conjugués
Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems
Generalization of ZYT-linearizability for bilinear datalog programs
Exploring sparse graphs with advice
Linear types and non-size-increasing polynomial time computation
Bounds on Algebraic Code Capacities for Noisy Channels. II
Generalising the maximum independent set algorithm via Boolean networks
On the computational complexity of bisimulation, redux
Baire categories on small complexity classes and meager-comeager laws
Influence of State Reduction on the Number of State Variables in Race-Free Asynchronous Sequential Circuits
On quotients of formal power series
Completeness and expressiveness of pointer program verification by separation logic
Erratum: "A Class of Low-Rate Nonlinear Binary Codes"
Higher Order Autocorrelation Functions as Translation Invariants
Execution information rate for some classes of automata
Verifying and interpreting neural networks using finite automata
Measuring the expressive power of practical regular expressions by classical stacking automata models
Optimal in-place suffix sorting
Exchange of indivisible goods under matroid constraints
Entropy of L-Fuzzy Sets
First-cycle games
Graph connectivity, partial words, and a theorem of Fine and Wilf
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
The CBH characterisation theorem beyond algebraic quantum theory
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
Simplifying Subtyping Constraints: A Theory
Practical Decomposition of Automata
Algorithmic complexity bounds on future prediction errors
Positive Tree Representations and Applications to Tree Automata
Learning all subfunctions of a function
Mechanising first-order temporal resolution
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition
Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. II: Applications to Dyadic Sampling Representations
On Some Properties of the Semigroup of a Machine Which are Preserved Under State Minimization
Deducibility and independence in Beklemishev's autonomous provability calculus
The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties
Re-visiting axioms of information systems
An Operational Semantics for Timed CSP
An Analysis of Ramsey's Theorem
How to build a probability-free casino
One-Way Multihead Writing Finite Automata
Automation for interactive proof: First prototype
A Denotational Theory of Synchronous Reactive Systems
On the Synchronizing Properties of Certain Prefix Codes
Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems
Zeroing neural network based on the equation AXA = A
A Modification of the Elias-Bound and Nontexistence Theorems for Perfect Codes in the Lee-Metric
Modeling oracles in simple temporal networks with uncertainty
Deducibility constraints and blind signatures
Capacitated automata and systems
On Acyclic Database Decompositions
On Unbounded Toeplitz Matrices and Nonstationary Time Series with an Application to Information Theory
On the Synthesis of de-Bruijn Sequences
Local temporal logic is expressively complete for cograph dependence alphabets
Distributive laws for the coinductive solution of recursive equations
Paths-based criteria and application to linear logic subsystems characterizing polynomial time
Minimum Polygonal Separation
Approximating Probability Distributions to Reduce Storage Requirements
Perfect failure detection with very few bits
Some Characterizations of Multihead Finite Automata
The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
Self-adjusting grid networks
Describing parameterized complexity classes
Erratum: "L p and Orlicz Stability of a Class of Nonlinear Timevarying Feedback Control Systems"
Exploiting pseudo-locality of interchange distance
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm
The h-step limited star connectivity of hypercubes
Low dimensional hybrid systems - decidable, undecidable, don't know
A Fully Abstract Model for the [pi]-calculus
A Study of the Statistics of Letters in English Words
Random elements in effective topological spaces with measure
An Infinite Hierarchy of Temporal Logics over Branching Time
Information rate of some classes of non-regular languages: An automata-theoretic approach
On degrees of ambiguity for Büchi tree automata
On sharing, memoization, and polynomial time
Interpreting a finitary pi-calculus in differential interaction nets
Bi-inductive structural semantics
Implicit complexity over an arbitrary structure: Quantifier alternations
Refining strategic ability in alternating-time temporal logic
A New Research into Default Logic
Weighted path queries on semistructured databases
A Formal Picture Description Scheme as a Basis for Picture Processing Systems
List-ranking on interconnection networks
A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors
Static and dynamic property-preserving updates
Discrimination by Parallel Observers: The Algorithm
Concurrent semantics for fusions: Weak prime domains and connected event structures
An SMT-based approach to satisfiability checking of MITL
A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time
Semi-Group, Group Quotient and Homogeneous Automata
A Robustized Vector Recursive Stabilizer Algorithm for Image Restoration
Entropies of Probabilistic Grammars
Temporal logic with recursion
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application
Investigations on Measure-One Identification of Classes of Languages
Improving convergence and practicality of slide-type reductions
Optimal Estimator for Linear Stochastic Systems Described by Functional Differential Equations
How to use several noisy channels with unknown error probabilities
Virtual Shared Memory: Algorithms and Complexity
The complexity of subcube partition relates to the additive structure of the support
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Order-(t-1) Balanced Multiple-Valued Filing Scheme Using Difference Vectors
Counting and sampling H-colourings?
Generalized budgeted submodular set function maximization
Unbounded quantum-classical separation in sample complexity for sphere center finding
Optimal Encodings of Linear Block Codes for Unequal Error Protection
Nonlinear neural P systems for generating string languages
On x^n + x + 1 over GF(2)
Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le
Conjunctions of Unate DNF Formulas: Learning and Structure
Nominal rewriting
A probabilistic calculus of cyber-physical systems
Difference Sets of the Hadamard Type and Quasi-Cyclic Codes
Loss and Recovery of Information by Coarse Observation of Stochastic Chain
An oracle builder's toolkit
Star-Free Regular Sets of omega-Sequences
Ready simulation for concurrency: It's logical!
Labeling Schemata and Synctactic Descriptions of Pictures
Partitioned PLTL model-checking for refined transition systems
Slowly synchronizing automata with fixed alphabet size
Completeness Problem of Multidimensional Tessellation Automata
Bounded-Reversal Multihead Finite Automata Languages
Reachability is decidable for weakly extended process rewrite systems
Composition of Top-Down and Bottom-Up Tree Transductions
The Achievement of Knowledge Bases by Cycle Search
A Note on Reversibility and Linear Filters
Model-Checking in Dense Real-time
The Redundancy of Texts in Three Languages
The Complexity of the Validity Problem for Dynamic Logic
Beyond Recursive Real Functions
On Capacity and Random Coding Exponent of a DMC
The Limit of Split n -Language Equivalence
Almost-Everywhere Superiority for Quantum Polynomial Time
Profile trees for Büchi word automata, with application to determinization
QCTL model-checking with QBF solvers
Wheeler languages
Advice hierarchies among finite automata
A Type System for Lock-Free Processes
Deciding determinism of unary languages
On m-adic Probabilistic Automata
Implicit Data Structures for Weighted Elements
CTL* with graded path modalities
The Algebra of Timed Processes, ATP: Theory and Application
On Sampling a Function and its Derivatives
Algebraic proofs over noncommutative formulas
A Generalization of Context-Free Determinism
Pair-independence and freeness analysis through linear refinement
On a Necessary Condition for L-Step Orthogonalization of Linear Codes and Its Applications
On the expressiveness of TPTL and MTL
Asymptotic elimination of partially continuous aggregation functions in directed graphical models
An automata-theoretic approach to the verification of distributed algorithms
The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages
Decidable Integration Graphs
On the Complexity of Inductive Inference
Terminal coalgebras and free iterative theories
New characterizations of primitive permutation groups with applications to synchronizing automata
Quantitative simulations by matrices
Unambiguous injective morphisms in free groups
A Note on Recognition of Hand-Printed Characters
Logical Relations and the Typed lambda-Calculus
Computing maximal palindromes in non-standard matching models
EXPTIME-completeness of thorough refinement on modal transition systems
An Automaton Decomposition for Learning System Environments
Breaking and fixing public-key Kerberos
Randomness with respect to c.e. semimeasures
Capacity of the Gaussian Channel without Feedback
Typed operational semantics for higher-order subtyping
Characterizing contrasimilarity through games, modal logic, and complexity
What is a Model of the Lambda Calculus?
On the complexity of single-rule datalog queries
The pseudopalindromic completion of regular languages
A Note on Synchronizable Error-Correcting Codes
Some Prediction Algorithms for Nonrecursive Sequences
Extended visual cryptography schemes
Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022)
Incentive ratio: A game theoretical analysis of market equilibria
On the Mechanical Simulation of Habit-Forming and Learning
The Complexity of Skewlinear Tuple Languages and o-Regular Languages
A Program for Correcting Spelling Errors
Multiparty communication complexity and very hard functions
Models of the Lambda Calculus
On the Measurement and Use of Time-Varying Communication Channels
Recognition of Typed Letters in Noise
Recognition of Deterministic ETOL Languages in Logarathimic Space
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information Security as a Resource
On the Characterization of the Amplitude and Shift of N-Periodic Sequences
The alternation hierarchy in fixpoint logic with chop is strict too
The complexity of minimal satisfiability problems
Principal abstract families of weighted tree languages
Erratum: "On Sampling a Function and its Derivatives"
Almost uniform deployment of mobile agents in dynamic rings
Complexity of two-variable dependence logic and IF-logic
Minimal Torsion Spaces and the Partial Input/Output Problem
On the Relationship between Computed Functions and Fixpoints of Nondeterministic Recursive Definitions
Branching interval algebra: An almost complete picture
Proposal of a New Coding Pattern in Orchard Scheme
Presenting functors on many-sorted varieties and applications
Axioms and Algorithms for Inferences Involving Probabilistic Independence
One-Step Completely Orthogonalizable Codes from Generalized Quadrangles
A Variant of the Kolmogorov Concept of Complexity
Timed network games
Special Issue: Selected papers of the 12th International Conference on Language and Automata Theory and Applications, LATA 2018
Homogeneous spiking neural P systems with synaptic failure
Model checking LTL with regular valuations for pushdown systems
Relations between Gold-style learning and query learning
On Threshold Decoding of Cyclic Codes
A Language Independent Proof of the Soundness and Completeness of Generalized Hoare Logic
Language-based Performance Prediction for Distributed and Mobile Systems
Constant delay traversal of grammar-compressed graphs with bounded rank
Time/Contention Trade-Offs for Multiprocessor Synchronization
From Operational Semantics to Domain Theory
Une théorie fonctionnelle de la réalisation en filtrage multidimensionnel, échantillonné, récurrent
Generic expression hardness results for primitive positive formula comparison
Stochastic Characterizations of EOL Languages
Decidability and Complexity Analysis by Basic Paramodulation
An efficient query learning algorithm for ordered binary decision diagrams
Permutation Cascades with Normalized Cells
A partial solution to an open problem of Amadio and Curien
Intuitionistic Modal Logic and Applications (IMLA 2008)
A Generalization of Shannon's Inequality and Its Application in Coding Theory
On the computational complexity of problems related to distinguishability sets
Special issue: Selected papers of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019
Selection and Ordering of Feature Observations in a Pattern Recognition System
Nonnegative Entropy Measures of Multivariate Symmetric Correlations
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Fast String Matching with Mismatches
Bootstrap Hybrid Decoding for Symmetrical Binary Input Channels
The Availability of Quorum Systems
The complexity of planarity testing
Infinite intersection types
On Efficient Burst Correcting Residue Polynomial Codes
A Note on Realization of Decision Networks Using Summation Elements
On Context-Free Matrix Forms
The Leech Lattice as a Code for the Gaussian Channel
Some (in)sufficient conditions for secure hybrid encryption
Phase Plane Analysis: The Application of Lienard's Construction to a Particularly Important Second Order Differential Equation
On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents
Hardness of fully dense problems
Approximate matching between a context-free grammar and a finite-state automaton
Design of a Balanced Multiple-Valued Filing Scheme of Order Two Based on Cyclically Generated Spread in Finite Projective Geometry
Output-Sensitive Methods for Rectilinear Hidden Surface Removal
A Note on Information Without Probability
Unreliable Channels are Easier to Verify Than Perfect Channels
On Minimum Mean-Square Error Linear Block Codes When the Data have q-adic Weighting
Proving Properties of Interactive Proofs by a Generalized Counting Technique
On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes
Robust worst cases for parity games algorithms
On the Power of Deterministic Transitive Closures
What is a "Good" Encoding of Guarded Choice?
Superposition with equivalence reasoning and delayed clause normal form transformation
A Categorical Characterization of General Automata
Algorithmic aspects of secure domination in unit disk graphs
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes
An Exponential Lower Bound for Real-Time Branching Programs
Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures
Two-User Interference Channels With Correlated Information Sources
Large Finite Structures with Few Lk-Types
Compositional verification and 3-valued abstractions join forces
The Application of the Ferranti Mercury Computer to Linguistic Problems
Simulation Preorder over Simple Process Algebras
Efficient Learning of Context-Free Grammars from Positive Structural Examples
Optimal Word Chains for the Thue-Morse Word
On prime scenarios in qualitative spatial and temporal reasoning
A Fully Abstract Denotational Model for Higher-Order Processes
Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
The Expressive Power of Indeterminate Dataflow Primitives
Complexity Classes of Optimization Functions
An Automata-Theoretical Characterization of the OI-Hierarchy
Finding Compact Scheme Forests in Nested Normal Form is NP-Hard
Closure Properties of Some Families of Languages Associated with Biological Systems
Alpha-Conversion and Typability
Approximation algorithms for non-sequential star packing problems
A Fast Expected Time Algorithm for Boolean Matrix Multiplication and Transitive Closure
A collapse theorem for holographic algorithms with matchgates on domain size at most 4
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
Predicates Definable over Transformational Derivations by Intersection with Regular Languages
On the Recognition of Families of Graphs with Local Computations
A Note on Pattern-Recognition Techniques and Game-Playing Programs
Bounds for Binary Codes Just Outside the Plotkin Range
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
On the consistency, expressiveness, and precision of partial modeling formalisms
The Convergence of Symmetric Threshold Automata
Locally Optimal Block Quantizer Design
The Parallel Complexity of Finite-State Automata Problems
Homomorphisms and Congruences for Abstract Feedback Systems
Proofs of proximity for context-free languages and read-once branching programs
On the Capacity of Channels with Additive Non-Gaussian Noise
Generation of Irreducible Polynomials from Trinomials over GF(2). II
A Timed Concurrent Constraint Language
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Sublattices of the Polynomial Time Degrees
Team equivalences for finite-state machines with silent moves
Symbolic computation in algebra, geometry, and differential equations
Exact algorithms for maximum independent set
Sur un Théorème de Shamir
Simplifying the Design of Knowledge-Based Algorithms Using Knowledge Consistency
Linear Dependence Structure of the Entropy Space
Linear-time parameterized algorithms with limited local resources
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs
Common Knowledge and Update in Finite Environments
On the Generative Capacity of Conditional Grammars
Learning by the Process of Elimination
Use of Orthogonal Signaling in Sequential Decision Feedback
A Note on a Partial Ordering for Communication Channels
The Minimalization of Tree Automata
Efficient Learning With Virtual Threshold Gates
Uncertainties and Optimal Control Approach to Feedback Control Problems
Nonlinearity and Propagation Characteristics of Balanced Boolean Functions
Tessellation Automata
Spectra of Frequency Modulation with Random Waveforms
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language
On the Existence of a Hamiltonian Path in a Graph
A semantic theory of the Internet of Things
Real-Time Logics: Complexity and Expressiveness
Reduction and covering of infinite reachability trees
Context-Sensitive Rewriting Strategies
A Generalized k-Nearest Neighbor Rule
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
On Codification in Finite Abstract Random Automata
Dimensions of Copeland-Erdös sequences
Linear-Time Simulation of Multihead Turing Machines
Modeling concurrency with interval traces
Perfect Nonbinary AN Codes with Distance Three
On Multistochastic Automata
Forêts Algébriques et Homomorphismes Inverses
An Infinite Pebble Game and Applications
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Simple Proofs of Some Theorems on Noiseless Channels
Nominal abstraction
Computability of probability measures and Martin-Löf randomness over metric spaces
Kolgomorov Complexity and Hausdorff Dimension
IO-Macrolanguages and Attributed Translations
Two double-exponential gaps for automata with a limited pushdown
On finite-index indexed grammars and their restrictions
Computation as social agency: What, how and who
On the termination of dynamics in sequential games
The Realization of Consistent Input-Output Sequences by Finite State Machines
Reply to "Final Note" by Benoit Mandelbrot
Metric quantifiers and counting in timed logics and automata
Guest Editorial: Workshop on Foundations of Object-Oriented Languages
Parametric and Nonparametric Detectors Based on a Sequential Sample Median Test
Comments on Two Theorems by Kandel
The Structural Information-Capacity of Optical Instruments
Probabilistic automata of bounded ambiguity