yusuke1997/dblp-id-title huggingface dataset:
Output Power Spectral Densities for Unipolar Pulse Frequency Modulation with White Noise Input
The Extended Entropy Uncertainty Principle
Space-Continuous Time-Semicontinuous Theory of Speed-Independent Asynchronous Circuits
Future temporal logic needs infinitely many modalities
Addendum to "Generalized Permutations in Convolutional Codes"
Intuitionistic hybrid logic: Introduction and survey
Syntax Directed Analysis of Liveness Properties
A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions
An Optimizing Method for Embedding Linear Graphs in N-Cube
Vector Analysis of Threshold Functions
Continuous Information Systems
Complexity of Automaton Identification from Given Data
A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem
The refinement calculus of reactive systems
Linear Graph Grammars: Power and Complexity
Nonlinear Recurrences and Arithmetic Codes
Context-Free Series on Trees
Generation and Enumeration of All Solutions of the Characteristic Sum Condition
Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets
Derivational Complexity of Context-Free Grammars
A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems
Secrecy and group creation
On the Observability of Decentralized Dynamic Systems
On a Problem of Nonlinear Mechanics
On Synchronous Variable Lenght Coding for Discrete Noiseless Channels
Maps Preserving the Uniformity of Neighborhood Interconnection Patterns in Tessellation Structures
Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps
An Extension of Tree Adjunct Grammars
Parallel Time O(log n) Recognition of Unambiguous Context-free Languages
Information gathering in ad-hoc radio networks with tree topology
Notions of Computation and Monads
Interpolation Theorems for Program Schemata
On the Discrete Time-Optimal Regular Control Problem
On an Extended Class of Error-Locating Codes
Depth Reduction for Circuits of Unbounded Fan-In
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines
On the Size of Machines
Polynomial Terse Sets
Expressiveness of probabilistic modal logics: A gradual approach
A Note on the Leech Lattice as a Code for the Gaussian Channel
Joint Detection, Estimation and System Identification
Dynamic Parallel Memories
Lower bound technique for length-reducing automata
Non-uniform cellular automata: Classes, dynamics, and decidability
Congruences Defined by Languages and Filters
A Circuit-Based Proof of Toda's Theorem
Simulating cardinal preferences in Boolean games: A proof technique
Deletion operations on deterministic families of automata
Preface to "Computation over Compressed Data" at DCC 2022
Analyzing pushdown systems with stack manipulation
On Boolean threshold functions with minimum specification number
Affine m-ary Gray Codes
A Logic for Constant-Depth Circuits
Signal-flow-based analysis of wireless security protocols
Some Dangers in State Reduction of Sequential Machines
Instruction-level security analysis for information flow in stack-based assembly languages
The Left-Discrimination Sequence of an Automaton
On periodicity of generalized two-dimensional infinite words
Distinguishing between communicating transactions
A Decidable Propositional Dynamic Logic with Explicit Probabilities
A Note on Segmentation of Computer Programs
The Maximum Mutual Information between Two Random Processes
On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions
Aperiodic Languages in Concurrency Monoids
On Average Mutual Information and Capacity for a Channel without Feedback and Contaminated Gaussian Noise
A new framework for deniable secure key exchange
Regular Probabilistic Languages
Updates and Subjunctive Queries
Note on the Gaussian Channel with Feedback and a Power Constraint
Asynchronous Byzantine Agreement Protocols
The complexity of constraint satisfaction games and QCSP
Decision problems of tree transducers with origin
On-line Turing Machine Recognition
On Functors Expressible in the Polymorphic Typed Lambda Calculus
Freeness properties of weighted and probabilistic automata over bounded languages
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
Functorial data migration
A space-efficient simulation algorithm on probabilistic automata
An Optimization Theory for Feedback Control System Design
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
Unique-Entry Graphs, Flowcharts, and State Diagrams
Information leakage due to operative errors in card-based protocols
A Note on Cellular Automata Simulations
Universal Goal-Seekers
Zero knowledge and circuit minimization
Generating Functions for Derivation Trees
A Generalized Grzegorczyk Hierarchy and Low Complexity Classes
A canonical automaton for one-rule length-preserving string rewrite systems
Context-Sensitive String Languages and Eecognizable Picture Languages
Detection of Moving Radar Targets in Clutter
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
Forward and Backward Simulations, II: Timing-Based Systems
Augmenting ATL with strategy contexts
Signal Detection of Rotational Processes and Frequency Demodulation
Completely iterative algebras and completely iterative monads
Adjacency in Digital Pictures
Axiomatizing Shuffle and Concatenation in Languages
The Word and Generator Problems for Lattices
More concise representation of regular languages by automata and regular expressions
Completeness of Path-Problems via Logical Reductions
Letter on a Paper by Eugene Schwartz and Adrienne Kleiboemer
Regular languages viewed from a graph-theoretic perspective
The Theory of Shift-Registers
Limitations of the Program Memory and the Expressive Power of Dynamic Logics
Coset Analysis of Reed Muller Codes Via Translates of Finite Vector Spaces
Recognizability, hypergraph operations, and logical types
Incompleteness of states w.r.t. traces in model checking
Decision Problems of Object histories
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks
Automata for regular expressions with shuffle
Modelling mutual exclusion in a process algebra with time-outs
On the price of fairness of allocating contiguous blocks
On the conjugacy problem of cellular automata
Multivariate Information Rate
Minimum Comparison Merging of Sets of Approximately Equal Size
Weak bisimulation is sound and complete for pCTL *
Complexity of automatic sequences
A Remark on Nets of Threshold Elements
Grammars with Structured Vocabulary: a Model for the \sc algol-68 Definition
Randomness in Distribution Protocols
Process Algebra for Synchronous Communication
On Duality in Learning and the Selection of Learning Terms
Stastical Models and Information Measurements for Two-level Digital Facsimile
Compatibility and Commutativity of Lock Modes
On the Transmission of Correlated Gaussian Data over a Noisy Channel with Finite Encoding Block Length
On a Class of Nonlinear Arithmetic Codes that Are Easy to Decode
On an open problem of Amadio and Curien: The finite antichain condition
Negation and Constraint Logic Programming
The equality problem for infinite words generated by primitive morphisms
Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems
On the decidability of the valuedness problem for two-way finite transducers
r-indexing the eBWT
Switching Functions Constructed by Galois Extension Fields
Verification of probabilistic systems with faulty communication
On the Complexity of Minimum Inference of Regular Sets
The boolean hierarchy of NP-partitions
On the Number of Affine Families of Boolean Functions
Splitting bisimulations and retrospective conditions
Syntactic characterization of learnability of structures with mind changes
The Capacity Region of a Channel with s Senders and r Receivers
The Dependence Capacity of Finite Borel Fields
On Fixed, Terminal Fixed and Nonterminal Fixed Interpretations of EOL Forms
Reactive, Generative and Stratified Models of Probabilistic Processes
The Dynamic Universality of Sigmoidal Neural Networks
On Truth-Table Reducibility to SAT
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
Fuzzy Sets and Their Operations
Characterising tree-like Frege proofs for QBF
Dyadic Sampling Approximations for Non-Sequency-Limited Signals
Channel Capacity of Equal Matrix Languages
The Complexity of Default Reasoning under the Stationary Fixed Point Semantics
Pomset bisimulation and unfolding for reset Petri nets
Representative Samples of Programmable Functions
A classification of 20-trinucleotide circular codes
The Church problem for expansions of (N, <) by unary predicates
On the Inference of Stochastic Regular Grammars
On the semantics of Markov automata
Coding for a Multiple-Access Channel
Consensus string problem for multiple regular languages
Existentially restricted quantified constraint satisfaction
Query complexity of generalized Simon's problem
Min-entropy as a resource
Composite event recognition with arbitrary specifications
Characterization of the Decomposable Groups and Group Functions
On the Index of Grammars and Languages
Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations
Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques
Toward the interpretation of non-constructive reasoning as non-monotonic learning
Computability on dI-Domains
On A Class of Error Correcting Binary Group Codes
Approximation algorithms for spanner problems and Directed Steiner Forest
A Decisive Characterization of BPP
Pre-analysis Locking
State Assignments for Reducing the Number of Delay Elements in Sequential Machines
A Compositional Proof System on a Category of Labelled Transition Systems
Scheduling on power-heterogeneous processors
Fair testing
Burst Distribution of a Coset of a Linear Code
Existence of Optimal Controls for a Class of Hereditary Systems with Lagging Control
Substitutions dans le EDTOL Systèmes Ultralinéaires
Linear Numeration Systems of Order Two
Spiking neural P systems with mute rules
Dynamic Interpolation Search revisited
Infinite games with finite knowledge gaps
A Biologically Motivated Extension of ALGOL-like Languages
Hierarchies and Space Measures for Pointer Machines
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
On the Undecidability of Implications Between Embedded Multivalued Database Dependencies
On the Decoding of a Class of Shortened Cyclic Codes for a Compound Channel
The reflective higher-order calculus: Encodability, typability and separation
Decidable call-by-need computations in term rewriting
Making random choices invisible to the scheduler
Universal solutions for temporal data exchange
Minimizing Expected Travel Time on Geometrical Patterns by Optimal Probability Rearrangements
Bounds for the D0L language equivalence problem
Hennessy-Milner properties via topological compactness
Online search with a hint
Information-Theoretical Considerations on Estimation Problems
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency
A family of syntactic logical relations for the semantics of Haskell-like languages
Models of Multi-User Write-Efficient Memories and General Diametric Theorems
Functions Realized by Consistent Sequential Machines
Distributability of mobile ambients
Comparison between text compression algorithms in biological sequences
On the Cycle Structure of Some Nonlinear Shift Register Sequences
Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets
A Note on Upper Bounds for Minimum Distance Codes
Nominal logic, a first order theory of names and binding
Semantics of Production Systems
Exponential Error Bounds for Discrete Memoryless Channels with Sequential Decision Feedback
About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus
Program Size in Restricted Programming Languages
A Characterization of Heaps and Its Applications
The modal logic of copy and remove
On the computational power of networks of polarized evolutionary processors
Anonymity protocols as noisy channels
Towards a theoretical understanding of why local search works for clustering with fair-center representation
On the Complexity of Designing Distributed Protocols
Automata of High Complexity and Methods of Increasing Their Reliability by Redundancy
k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
Distinguishing string selection problems
Partial Morphisms in Categories of Effective Objects
Logarithmic space and permutations
Further Results on Asymmetric Authentication Schemes
Functional Dependencies and Constraints on Null Values in Database Relations
On the computational completeness of matrix simple semi-conditional grammars
Symmetries, local names and dynamic (de)-allocation of names
Limiting Frequency-Modulation Spectra
Regularity Preserving Modifications of Regular Expressions
Safety Analysis versus Type Inference
On the Length of Feedback Shift Registers
A binary modal logic for the intersection types of lambda-calculus
Computational Complexity of Recursively Enumerable Sets
On Finding the Minimum Bandwidth of Interval Graphs
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control
Statistical Estimation of the Intrinsic Dimensionality of Data Collections
Subtyping recursion and parametric polymorphism in kernel fun
Proof systems that take advice
Analysis of dynamic policies
Algorithms for Graph Problems on BNLC Structured Graphs
A Few Remarks on the Index of Context-Free Grammars and Languages
Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states
On Context-Free Languages and Push-Down Automata
Function Definitions in Term Rewriting and Applicative Programming
12th international symposium on stabilization, safety, and security of distributed systems
Complexity of Generalized Satisfiability Counting Problems
Entropy and the Uncertainty Principle
Parallel Recognition of Series-Parallel Graphs
Holographic algorithms beyond matchgates
Cut elimination in coalgebraic logics
Learning in the Presence of Partial Explanations
An algebraic attack on the key exchange protocol based upon a modified tropical structure
Predicting \0,1\-Functions on Randomly Drawn Points
The Independence Inequality and Its Application to Information Theory
Bi-immunity separates strong NP-completeness notions
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems
Nested semantics over finite trees are equationally hard
On the Starheight of Some Rational Subsets Closed under Partial Commutations
The Design of Conditional Probability Computers
Differential privacy in probabilistic systems
Krivine machines and higher-order schemes
Deriving structural labelled transitions for mobile ambients
On the Number of Information Symbols in Bose-Chaudhuri Codes
Complexity and Categoricity
Interconnecting Asynchronous Control Networks
Programs for Instruction Machines
Presynthesis of bounded choice-free or fork-attribution nets
A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations
Probabilistic Automata-A Problem of Paz
On the Intrinsic Complexity of Learning
Proving Nondeterministically Specified Safety Properties Using Progress Measures
Mutual visibility by luminous robots without collisions
An upper bound on the derivational complexity of Knuth-Bendix orderings
State Space Evaluation of the Bhattacharyya Distance between Two Gaussian Processes
The complexity of multi-mean-payoff and multi-energy games
An Information Measure of Association in Contingency Tables
Trading information complexity for error II: The case of a large error and the external information complexity
Data reduction for graph coloring problems
The tail-recursive fragment of timed recursive CTL
Complete Degrees of Finite-State Transformability
On enumerating algorithms of novel multiple leaf-distance granular regular α -subtrees of trees
LZRR: LZ77 parsing with right reference
Elimination of Static and Dynamic Hazards for Multiple Input Changes in Combinatorial Switching Circuits
Removing nondeterminism in constant height pushdown automata
Communication Complexity Method for Measuring Nondeterminism in Finite Automata
Sampling Theorems and Bases in a Hilbert Space
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's
Probabilistic computability and choice
A Theory of Higher Order Communicating Systems
Mean-payoff games and propositional proofs
Block Coding for Stationary Gaussian Sources with Memory Under a Square-Error Fidelity Criterion
Revisiting constraint-directed search
Binary and circular automata having maximal state complexity for the set of synchronizing words
Harmonic Analysis over Finite Commutative Groups in Linearization Problems For Systems of Logical Functions
Bisimulation from Open Maps
Algebraic Decoding of Block Codes over a q-ary Input, Q-ary Output Channel, Q>q
Alternating two-way AC-tree automata
Simplifications of Homomorphisms
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems
Approximating labelled Markov processes
A Converse to the Jordan Curve Theorem for Digital Curves
Bayesianism: An Algorithmic Analysis
Alternation and Bounded Concurrency Are Reverse Equivalent
Behavioural strategies in weighted Boolean games
A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory
The complexity of regex crosswords
Non-linear communication via graded modal session types
On Similarity and Duality of Computation (I)
Computability and realizability for interactive computations
A calculus for collective-adaptive systems and its behavioural theory
Biased differential distinguisher - Cryptanalysis of reduced-round SKINNY
Detection Theory and Quantum Mechanics
Modular Arithmetic Weight and Cyclic Shifting
Random Sampling and Reconstruction of Spectra
Team Tournaments and Finite Elementary Codes
On the Existence, Uniqueness, and Stability Behavior of a Random Solution to a Nonlinear Perturbed Stochastic Integro-Differential Equation
A Computational Method for Feedback Control Optimization
Sampling and Reconstruction of Wave-Number-Limited Functions in N-Dimensional Euclidean Spaces
Approximation of Weighted Type 0 Languages by Formal Power Series
Lower and upper bounds on obtaining history independence
Complete inference systems for weak bisimulation equivalences in the pi-calculus
Computational Limits on Team Identification of Languages
Some Problems of Finite Representability
On modularity in infinitary term rewriting
Nonerasing, Counting, and Majority over the Linear Time Hierarchy
Remarks on Thatte's transformation of term rewriting systems
Fixing monotone Boolean networks asynchronously
Life and Death in Markov Deterministic Tabled OL Systems
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines
Synthesising CCS bisimulation using graph rewriting
Automated deep abstractions for stochastic chemical reaction networks
Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity
Algebraic Automata and Context-Free Sets
Structural Complexity of Context-Free Languages
Combinatorial sharpness criterion and phase transition classification for random CSPs
On the strength of comparisons in property testing
Static analysis of topology-dependent broadcast networks
An Extension of the Entropy Theorem for Parameter Estimation
Linear Concurrent Constraint Programming: Operational and Phase Semantics
Using heuristic search for finding deadlocks in concurrent systems
On the Power of the Shift Instruction
Tree Generating Regular Systems
Relating computational effects by ⊤⊤-lifting
On probabilistic pushdown automata
Parallel Beta Reduction Is Not Elementary Recursive
Parameterized computational complexity of Dodgson and Young elections
Generalized Reed-Muller Codes
Foundations for Extensible Objects with Roles
Decoupling in a Class of Nonlinear Systems by Output Feedback
Multi-buffer simulations: Decidability and complexity
Range majority in constant time and linear space
Shrinking timed automata
Loop-Free Structure of Sequential Machines
Automatic decidability and combinability
Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75]
A Note on Deterministic and Nondeterministic Time Complexity
A Proof of the Kahn Principle for Input/Output Automata
Elementary Bounded Languages
A Note on Cycle Grammars
Algorithms for Determining Relative Star Height and Star Height
Doomsday equilibria for omega-regular games
Entropy of Tamil Prose
The Equivalence of Digital and Analog Signal Processing
Two-State Two-Symbol Probabilistic Automata
Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020)
Iterative learning from positive data and negative counterexamples
40th international colloquium on automata, languages and programming
Turing machines, transition systems, and interaction
Functional and (Constraint) Logic Programming
Synchronizable Error-Correcting Codes
Distance constraint satisfaction problems
Linear context-free tree languages and inverse homomorphisms
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
A semantic theory for value-passing processes based on the late approach
Synchronized, Desynchronized and Coordinated EOL Systems
Characterising REGEX languages by regular languages equipped with factor-referencing
Some Remarks on Multistochastic Automata
Multivariate to bivariate reduction for noncommutative polynomial factorization
Optimal simulation of self-verifying automata by deterministic automata
Quasi-static scheduling of communicating tasks
Comment on an Algorithm that Generates Fuzzy Prime Implicants by Lee and Chang
On Single-Loop Realizations of Sequential Machines
Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages
Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification
Allen-like theory of time for tree-like structures
Treewidth computations II. Lower bounds
A Model for a Self-Adapting Filter
Projection theorems using effective dimension
Upper Bounds on the Cardinality of a Binary Code with a Given Minimum Distance
The Dimension of a Formal Language
Improved approximations for the capacitated vehicle routing problem with fixed capacity
The number of convex permutominoes
Some Properties of Fuzzy Logic
A Scale of Context Sensitive Languages: Applications to Natural Language
Stable Semantics for Probabilistic Deductive Databases
On the Bhattacharyya Distance and the Divergence between Gaussian Processes
String Matching Problems over Free Partially Commutative Monoids
Local reduction
Quantitative model-checking of controlled discrete-time Markov processes
HR-SQL: Extending SQL with hypothetical reasoning and improved recursion for current database systems
The complexity of finite model reasoning in description logics
Dealing with Zero-Time Transitions in Axiom Systems
Comparing operational models of name-passing process calculi
Complexity of validity for propositional dependence logics
Phrase Structure Languages, Finite Machines, and Channel Capacity
Higher Order Unification via Explicit Substitutions
A categorical outlook on relational modalities and simulations
The context-splittable normal form for Church-Rosser language systems
Testing and Generating Infinite Sequences by a Finite Automaton
Complexity of the First-Order Theory of Almost All Finite Structures
Parsing Macro Grammars Top Down
Increasing the Similarity of EOL Form Interpretations
A Unified Approach for Deciding the Existence of Certain Petri Net Paths
Order-Sorted Inductive Types
Fairness in Context-Free Grammars under Every Choice-strategy
Aggregating Inductive Expertise