yusuke1997/dblp-id-title huggingface dataset:
Complexity of infinite words associated with beta-expansions
Undecidability of the equivalence of finite substitutions on regular language
Unambiguous recognizable two-dimensional languages
A symmetry property of Christoffel words
Cohesiveness in promise problems
On context-free rewriting with a simple restriction and its computational completeness
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
Linear grammars with one-sided contexts and their automaton representation
The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues
Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog
Universality of Reversible Hexagonal Cellular Automata
Distance desert automata and the star height problem
Comparison of basic language generating devices (non-deterministic systems)
Decision making strategy for δ - I equilibrium problem in network designing
Loops in automata and HDTOL relations
On the distribution of characteristic parameters of words II
Systems of parallel communicating restarting automata
Bi-infinitary codes
Note on the complexity of Las Vegas automata problems
Efficient Reductions of Picture Words
On Deciding some Equivalences for Concurrent Processes
Finding H-partitions efficiently
Tests et leur Caractérisation Syntaxique
On simple representations of language families
On Parallel Deletions Applied to a Word
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
Sur la Complexité de Certains Algorithmes ou Intervient la Séparation des Racines d'un Polynome
PCP-Prime Words and Primality Types
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
Towards a theory of practice in metaheuristics design: A machine learning perspective
On the syntactic complexity of tree series
On Conjugacy of Languages
Codes avec des Mots Infinis
Définitions Récursives Par Cas
Foreword - Special issue dedicated to the fifteenth "Journées Montoises d'Informatique Théorique"
Cutwidth of the r -dimensional mesh of d -ary trees
Sur La Minimisation D'une Expression Représentant une Famille de Fonctions Booléennes
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
An Approach to Parallel Algorithm Design
Paradis terrestre dans l'automate cellulaire de Conway
On finitely generated monoids of matrices with entries in N
A morphic approach to combinatorial games: the Tribonacci case
Pattern avoiding and q -decreasing binary words
Relative Goodness for EOL Forms
Data Types as Algorithms
On the median-of-K version of Hoare's selection algorithm
The Complexity of the Travelling Repairman Problem
Certificateless ring signature based on RSA problem and DL problem
Une Généralisation de la Théorie des Types en lambda-Calcul (II)
Asymptotic behaviour of bi-infinite words
Decomposing A k -Valued Transducer into k Unambiguous Ones
On Frontiers of Regular Trees
Résultats de complétude pour des classes de types du système AF 2
Frontiers of Infinite Trees
Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
The Fibonacci automorphism of free Burnside groups
On existentially first-order definable languages and their relation to NP
Spécialisation de la suite de Sturm
Tree algebra of sofic tree languages
Arithmetic Coding of Weighted Finite Automata
Mots Sans Répétitions et Langages Rationnels Bornés
On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages
Efficient simulation of synchronous systems by multi-speed systems
Generalisation de la Notion de Langage a Contexte Libre. Application a l'Analyse Syntaxique de Figures
Enumeration of Colored Tilings on Graphs via Generating Functions
On the Difficulty of Finding Walks of Length k
Compatibility relations on codes and free monoids
Grammaires Parenthésées et Bilangages Réguliers
Semantics of value recursion for Monadic Input/Output
From Bi-ideals to Periodicity
Algorithme de multiplicativité des sommes des carrés
An upper bound for transforming self-verifying automata into deterministic ones
Solving word equations
A note on the number of squares in a partial word with one hole
Limiting Characterizations of Low Level Space Complexity Classes
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators
On the Semidirect Product of the Pseudovariety of Semilattices by a Locally Finite Pseudovariety of Groups
One counter languages and the chevron operation
Parameterizing higher-order processes on names and processes
Fewest repetitions in infinite binary words
Two sided Sand Piles Model and unimodal sequences
On Some Elementary Properties of Uniform Automata
Relationships between vertex attack tolerance and other vulnerability parameters
Multiple-Precision Correctly rounded Newton-Cotes quadrature
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions
Mots infinis et produits de matrices à coefficents polynomiaux
Generalized Ternary Simulation of Sequential Circuits
On Lindenmayerian Rational Subsets of Monoids
Domination problems on P 5 -free graphs
Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
Analysis of a local search algorithm for the k-facility location problem
Correct rounding of algebraic functions
Languages Obtained from Infinite Words
Automates de Coût Borné Sur Un Alphabet A Une Lettre
Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique"
Real and complex pseudozero sets for polynomials with applications
Propagating Sets in Sierpiński Fractal Graphs
Elementariness of a finite set of words is co-NP-complete
A Simple Proof of Valiant's Lemma
Topological automata
Deux Propriétés Combinatoires Des Nombres De Schröder
Measuring the problem-relevant information in input
Equations on partial words
Sémantique des Structures de Contrôle
Increasing integer sequences and Goldbach's conjecture
Parikh test sets for commutative languages
On universal partial words for word-patterns and set partitions
Mots infinis et langages commutatifs
A short proof that shuffle squares are 7-avoidable
On A Class of Infinite Words with Bounded Repetitions
A non-uniform finitary relational semantics of system T
Inf-datalog, Modal Logic and Complexities
On a Test of Square-Free Morphisms
Least Periods of Factors of Infinite Words
On the decidability of semigroup freeness
Prescribed Ultrametrics
Combinatorial Analysis of Quicksort Algorithm
Consecutive pattern-avoidance in Catalan words according to the last symbol
Directive words of episturmian words: equivalences and normalization
Probabilistic models for pattern statistics
Sémantique formelle des opérateurs d'un langage de listes
Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton
Automates et Commutations Partielles
Look and Say Fibonacci
On the Ehrenfeucht Conjecture for DOL Languages
Minimal partial languages and automata
Decision algorithms for Fibonacci-automatic Words, I: Basic results
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
Calcul de La Distance Par Les Sous-Mots
Repetition thresholds for subdivided graphs and trees
Series which are both max-plus and min-plus rational are unambiguous
Integer Partitions, Tilings of 2D -gons and Lattices
Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
Sur le produit avec compteur modulo un nombre entier
Algorithme de Décomposition de Clés
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
Deux constructions équivalentes d'un jeu d'arrengements puor les fichiers inverse multi-indices
An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees
The behaviour of parsing time under grammar morphisms
On Varieties of Literally Idempotent Languages
Improvements on the 4-adic complexity of a class of quaternary sequences
A New Class of Balanced Search Trees: Half Balanced Binary Search Trees
The Independence of Certain Operations on semiAFLS
State hyperstructures of tree automata based on lattice-valued logic
Non-primitive words of the form pq m
Détermination de la Représentation Standard d'une Série Reconnaissable
Nombre de sauts et graphes série-parallèles
Coalgebras for Binary Methods: Properties of Bisimulations and Invariants
An improved derandomized approximation algorithm for the max-controlled set problem
Probabilistic operational semantics for the lambda calculus
A complete characterization of primitive recursive intensional behaviours
Linear size test sets for certain commutative languages
Intuitionistic three-valued logic and logic programming
Mots de Lyndon et Périodicité
Théorie des Magmoïdes (II)
Sequential monotonicity for restarting automata
Fractal Geometry, Turing Machines and Divide-and-Conquer Recurrences
Returning and non-returning parallel communicating finite automata are equivalent
Uet Flow Shop Scheduling with Delays
A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages
The topologies of sofic subshifts have computable Pierce invariants
Categories Et Langages De Dot-Depth Un
Sémantique des Processus Communicants
The Closure Under Division and a Characterization of the Recognizable Z -Subsets
Some problems in automata theory which depend on the models of set theory
An abstract monadic semantics for value recursion
Complément A L'étude des Suites de Thue-Morse Généralisées
Une Caractérisation des Langages Algébriques Bornés
Efficient Generation of some Greedy Binary Gray codes
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
On Lamport's Comparison Between Linear and Branching Time Temporal Logic
Epsilon weak precedence grammars and languages
Description d'une Classe de Grammaires de Graphes sans Circuit
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
A graphical representation of relational formulae with complementation
A Hierarchy of Cyclic Languages
Single-Tape Reset Machines
Une Formalisation de la Sémantique des Langages de Programmation
On the Average Case Complexity of Some P-complete Problems
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space
Poids Et Équivalence Des Codes Linéaires
On Bandwidth, Cutwidth, and Quotient Graphs
Algebraic and graph-theoretic properties of infinite n-posets
On the equivalence of linear conjunctive grammars and trellis automata
From indexed grammars to generating functions
Partially Abelian squarefree words
A note on the Size-Ramsey number of long subdivisions of graphs
Cônes Rationnels Commutativement Clos
Recursive coalgebras of finitary functors
On the joint 2-adic complexity of binary multisequences
Linear Complexity and 2-Adic Complexity of New Cyclotomic Binary Sequences of Order Four with Low Autocorrelation
Bipartite binomial heaps
Permissive strategies: from parity games to safety games
Creating a network-state homomorphism through optimization
Two-way automaton computations
The pseudovariety of semigroups of triangular matrices over a finite field
Improved lower bounds on the approximability of the Traveling Salesman Problem
Topologies, continuity and bisimulations
Sturmian jungle (or garden?) on multiliteral alphabets
Enumerated type semantics for the calculus of looping sequences
Rational series with high image complexity
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
Efficient weighted expressions conversion
A generalization of traces
Une forme canonique pour les grammaires simples déterministes
There is no complete axiom system for shuffle expressions
Learning deterministic regular grammars from stochastic samples in polynomial time
A propos de la sémantique de l'appel par valeur selon A. Arnold
One quantifier alternation in first-order logic with modular predicates
Graph Congruences and Pair Testing
Une caractérisation des générateurs standard
Transductions Rationnelles Décroissantes
Normal forms for phrase-structure grammars
Arbres Binaires de Recherche: Propriétés Combinatioires et Applications
On Semidirect and Two-Sided Semidirect Products of Finite J-Trivial Monoids
A new algebraic invariant for weak equivalence of sofic subshifts
On Infinitary Finite Length Codes
A distributed voting scheme to maximize preferences
A Note Concerning the Limit Distribution of the Quicksort Algorithm
Analysis of a near-metric TSP approximation algorithm
Squares and cubes in Sturmian sequences
An efficient certificateless multi-receiver threshold decryption scheme
Asymtpotical Estimation of Some Characteristics of Finite Graphs
FPOL Systems Generating Counting Languages
Complexity Classes Between Theta P k and Delta P k
Sur les ensembles de mots infins engendrés par une grammaire algébrique
On primitive words with non-primitive product
Complexity results for prefix grammars
Derived sequences of complementary symmetric Rote sequences
Square-root rule of two-dimensional bandwidth problem
Words over an ordered alphabet and suffix permutations
On Real Time and Linear Time Cellular Automata
Superfluous Arcs and Confluent Reductions in the Minimum Feedback Vertex Set Problem
The Topological Structure of Adherences of Regular Languages
On a probabilistic extension of the Oldenburger-Kolakoski sequence
On double-jumping finite automata and their closure properties
Some decision problems on integer matrices
The average lower reinforcement number of a graph
Fuites dans les réseaux de Petri
On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup
Mots Infinis Engendrés par Une Grammaire Algébrique
Accepting networks of evolutionary processors with resources restricted and structure limited filters
Polynomials over the reals in proofs of termination: from theory to practice
On Semigroups of Matrices over the Tropical Semiring
A limit theorem for "Quicksort"
Some Theorems on Graph Congruences
Three generators for minimal writing-space computations
Calcul Réparti D'un Extrémum Et Du Routage Associé Dans Un Réseau Quelconque
Approximate counting: an alternative approach
Finite Completion of comma-free codes. Part 2
Entropy generation in a model of reversible computation
Sur Quelques Classes D'Applications De N 2 Dans Les Ensembles Finis
On Ranking 1-Way Finitely Ambiguous NL Languages and #P 1 -Complete Census Functions
Strong Iterative Pairs and The Regularity of Context-Free Languages
Speeding up the computations on an elliptic curve using addition-subtraction chains
The theorem of Fine and Wilf for relational periods
Dénombrements de Chemins Dans -Real 2 Soumis A Contraintes
On substitution invariant Sturmian words: an application of Rauzy fractals
Regular languages definable by Lindström quantifiers
Continuous Monoids and Yields of Infinite Trees
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs
The local catenativity of DOL-sequences in free communitative monoids is decidable in the binary case
Zagreb index in exponential plane-oriented recursive trees
Monotone (co)inductive types and positive fixed-point types
Superiority of one-way and realtime quantum machines
A graph approach to computing nondeterminacy in substitutional dynamical systems
Représentations Matricielles Des Séries D'Arbre Reconnaissables
String distances and intrusion detection: Bridging the gap between formal languages and computer security
About the decision of reachability for register machines
Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems
Domain-free [lambda][mu]-calculus
Sequential Mappings of omega-Languages
On a code problem concerning planar acyclic graphs
Calculs d'invariants primitifs de groupes finis
Languages of finite words occurring infinitely many times in an infinite word
A Note on the Undecidability of Contextfreeness
Relational Data Base Design Using Refinement Rules
Reducing the gradedness problem of string rewriting systems to a termination problem
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
Lambda-calcul, évaluation paresseuse et mise en mémoire
Mots Infinis de Fibonacci et Morphismes Itérés
Parallel Computation on 2-3-Trees
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation
Equational description of pseudovarieties of homomorphisms
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
Characterization results about L codes
Implementing term rewriting by jungle evaluation
On Some Packing Problem Related to Dynamic Storage Allocation
Sur Les Groupes Syntaxiques D'un Langage
On bi-infinite and conjugate post correspondence problems
On-Line Computations of the Ideal Lattice of Posets
On Subword Complexities of Homomorphic Images of Languages
The perfection and recognition of bull-reducible Berge graphs
Complexity issues of perfect secure domination in graphs
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
Finite idempotent groupoids and regular languages
Non-looping string rewriting
Three notes on the complexity of model checking fixpoint logic with chop
An introduction to quantum annealing
On the state complexity of semi-quantum finite automata
Time and space complexity of reversible pebbling
Combined complexity classes for finite functions
The connectivity and nature diagnosability of expanded k -ary n -cubes
Picture codes
Graph fibrations, graph isomorphism, and PageRank
On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids
Entiers intuitionnistes et entiers classiques en lambda C -calcul
Decidable Subcases of The Equivalence Problem for Recursive Program Schemes
Efficiency of automata in semi-commutation verification techniques
Incremental DFA minimisation
Opérateurs de mise en mémoire et types forall-positifs
Sequences of low arithmetical complexity
Codes générateurs minimaux de langages de mots bi-infinis
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem
Yield-Languages Recognized by Alternating Tree Recognizers
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy: Part I
Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
A Generalisation of Entity and Referential Integrity in Relational Databases
Weakly maximal decidable structures
Schützenberger-Like Products in Non-Free Monoids
Corrigendum to our paper: How Expressions Can Code for Automata
Langages Persistants
Deterministic blow-ups of minimal NFA's
One-Rule Semi-Thue Systems with Loops of Length One, Two or Three
On geometric automata which can nondeterminstically choose auxiliary points
Closure under union and composition of iterated rational transductions
Introduction aux polyèdres en combinatoire d'apres E. Ehrhart et R. Stanley
On Sets Bounded Truth-Table Reducible to P-Selective Sets
Categorial approach to nonlinear constant continuous-time systems
Polynomial Size Test Sets for Commutative Languages
Étude Et Implémentation D'Un Système De Déduction Pour Logique Algorithmique
On coding morphisms for zigzag codes
On some problems related to palindrome closure
Matrix versions of a aperiodic K-rational identities
Maximum values of sombor index of bicyclic graphs with a given matching number
Different time solutions for the firing squad synchronization problem on basic grid networks
Parties reconnaissables de monoïdes déinis par générateurs et relations
Some results on C-varieties
On Free Inverse Monoid Languages
On algebraic specifications of computable algebras with the discriminator technique
On Schemata and systems for parallel algorithms
Valeurs Propres et Vecteurs Propres en Calssification Hiérarchique
Bottom-Up Computation of Recursive Programs
Codes Limites Et Factorisations Finies Du Monoïde Libre
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
On graph products of automatic monoids
Construction of tree automata from regular expressions
Computing the Rabin Index of a Parity Automaton
Fixpoints, games and the difference hierarchy
Pm Numbers, Ambiguity, and Regularity
On the structure of (- β )-integers
A Note On Fixpoint Techniques in Data Base Recursive Logic Programs
Autonomous Posets and Quantales
Equality sets for recursively enumerable languages
Monadic Expressions and Their Derivatives
Automata with cyclic move operations for picture languages
On global induction mechanisms in a µ-calculus with explicit approximations
Using Persistent Data Structures for Adding Range Restrictions to Searching Problems
On a tree collision resolution algorithm in presence of capture
A sharpening of the Parikh mapping
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers
Unavoidable Languages, Cuts and Innocent Sets of Words
On the number of iterations required by Von Neumann addition
Reduction Algorithms for Some Classes of Aperiodic Monoids
Binary Trees, Fringe Thickness and Minimum Path Length
Feedback, trace and fixed-point semantics
On Effective Speed-Up and Long Proofs of Trivial Theorems in Formal Theories
On equality sets of morphisms in topological free monoids
Reversible Computations of One-Way Counter Automata
The finiteness problem for monoids of morphisms
Indécidabilité de la Condition IRS
Comparing Complexity Functions of a Language and Its Extendable Part
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
Random Generation for Finitely Ambiguous Context-free Languages
Systèmes de Déduction pour les Arbres et les Schémas de Programme (II)
Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height k
Complexity of theorem-proving procedures : some general properties
Tree Automata and Automata on Linear Orderings
An Imperative Language Based on Distributive Categories II
On the accepting state complexity of operations on permutation automata
Job shop scheduling with unit length tasks
Post Grammars as a Programming Language Description Tool
The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences
Improved approximations for ordered TSP on near-metric graphs
Multi-dimensional sets recognizable in all abstract numeration systems
Translation of a Digital Line into another according to various Digitization Processes
A Decision Method for The Recognizability of Sets Defined by Number Systems
Construction of very hard functions for multiparty communication complexity
Note sur la Suppression des Étiquettes en Programmation
Sémantique Algébrique d'un Langage de Programmation Type Algol
Corrigendum: On multiperiodic words
On Subdirectly Irreducible Automata
A Limiting Distribution for Quicksort
On the power of two-way multihead quantum finite automata
A Semigroup Characterization of Dot-Depth one Languages
Hereditary properties of words
Compositions De Fonctions De Commutation Partielle
Subdivisions de surfaces et cartes généralisées de dimension 2
Factorisation sur Z[X] des polynômes de degré élevé à l'aide d'un monomorphisme
A conjecture on the concatenation product
ICTCS 09 Foreword
A generator of morphisms for infinite words
Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming
Quelques problèmes ouverts en théorie des langages algébriques
Number-Conserving Reversible Cellular Automata and Their Computation-Universality
A Hierarchy of Automatic $\omega$-Words having a Decidable MSO Theory
Hierarchies of Aperiodic Languages
Rewriting on cyclic structures: Equivalence between the operational and the categorical description
Bijective Sequential Mappings of a Free Monoid Onto Another
Rebootable and suffix-closed omega-power languages
A note on a two dimensional knapsack problem with unloading constraints
On the Topological Complexity of Infinitary Rational Relations
Parallélisation d'algorithmes avec un nombre fixe de processeurs