yusuke1997/dblp-id-title huggingface dataset:
On the simplest centralizer of a language
In memoriam: Philippe Flajolet, the father of analytic combinatorics
Substitutions par des motifs en dimension 1
Return words in Sturmian and episturmian words
The globals of pseudovarieties of ordered semigroups containing B2 and an application to a problem proposed by Pin
Hiérarchies de Concaténation
Langages très simples générateurs
Parameterized exact and approximation algorithms for maximum k -set cover and related satisfiability problems
Un Modèle Fonctionnel des Structures de Contrôle
Unavoidable set: extension and reduction
Radix enumeration of rational languages
Combinatoire de mots récurrents de complexité n+2
Semantics on Flowchart Programs and the Free Conway Theories
Free Burnside Semigroups
Integers in number systems with positive and negative quadratic Pisot base
Function operators spanning the arithmetical and the polynomial hierarchy
Cycle and Path Embedding on 5-ary N-cubes
Non Recursive Functions Have Transcendental Generating Series
Drunken man infinite words complexity
Synchronizing series-parallel deterministic finite automata with loops and related problems
Bounded Queries to Arbitrary Sets
Avoiding conjugacy classes on the 5-letter alphabet
Trace Languages Defined by Regular String Languages
Local transition functions of quantum Turing machines
Construction, Évaluation et Amélioration Systématiques de Structures de Données
Systèmes de Déduction pour les Arbres et les Schémas de Programmes
Iteration of rational transductions
On Context Constrained Squares and Repetitions in a String
Inevitability in diamond processes
On digital blocks of polynomial values and extractions in the Rudin-Shapiro sequence
Traces of term-automatic graphs
Efficient String Matching on Packed Texts
Density of Critical Factorizations
Majoration de la norme des facteurs d'un polynôme: cas où toutes les racines du polynôme sont réelles
A CAT algorithm for the exhaustive generation of ice piles
On The Complexity of Computable Real Sequences
Sur l'Auto- Stabilisation dans un Réseau d'Ordinateurs
Mineurs d'arbres avec racines
Production En Temps Réel Et Complexité De Structure De Suites Infinies
Unambiguous erasing morphisms in free monoids
Decidability of Periodicity for Infinite Words
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma
A Note on the Recognition of One Counter Languages
A Fibonacci analogue of the two's complement numeration system
Cellular automata and powers of p ∕ q
Analysis of a Class of Graph Partitioning Problems
k -counting automata
Repetitions and permutations of columns in the semijoin algebra
A sparse dynamic programming algorithm for alignment with non-overlapping inversions
Motifs Et Bases De Langages
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
Exact location of the phase transition for random (1, 2)-QSAT
Morphisms preserving the set of words coding three interval exchange
Pumping and Pushdown Machines
Further results on generalized conditional entropies
A bound for the [omega]-equivalence problem of polynomial D0L systems
The compositional construction of Markov processes II
On the proper intervalization of colored caterpillar trees
Smooth and sharp thresholds for random k -XOR-CNF satisfiability
Equivalences and Congruences on Infinite Conway Games
GLS: New class of generalized Legendre sequences with optimal arithmetic cross-correlation
Un langage algébrique particulier
The Communication Hierarchy of Time and Space Bounded Parallel Machines
Decision problems among the main subfamilies of rational relations
Deciding knowledge in security protocols under some e-voting theories
An isolated point in the Heinis spectrum
On biautomata
A novel image encryption algorithm based on the extracted map of overlapping paths from the secret key
Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T[x] of T
Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés
Une Approche Quantitative de L'Exclusion Mutuelle
Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages
Étude De La Séparation Et De L'Élimination Sur Une Famille De Graphes Quotients Déduite D'Une Méthode De Dissections Emboîtées
Une Généralisation de la Théorie des Types en \lambda-Calcul (Première partie)
Automata-based Representations for Infinite Graphs
On the length of uncompletable words in unambiguous automata
On the Structure of Recognizable Languages of Dependence Graphs
Episturmian morphisms and a Galois theorem on continued fractions
Learning tree languages from text
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
Kleene closure and state complexity
On possible growths of arithmetical complexity
The Helping Hierarchy
Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
Parity codes
An aperiodicity problem for multiwords
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2
A parenthesis machine for string manipulation
HBS and star tilings: State of the art and novel observations
On the invertibility of finite linear transducers
Digital Search Trees with Keys of Variable Length
Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique
Right and Left Invertibility in lambda-beta-Calculus
Fast Diagnosis of Multiprocessor Systems with Random Faults
Asymptotical Behaviour of Some Non-Uniform Measures
Minimum Complexity of Automatic non Sturmian Sequences
Normalization of edit sequences for text synchronization
On the parameterized complexity of approximate counting
Topologies sur des Espaces Ordonnés
Probabilistic Analysis of Two Euclidean Location Problems
Calculi of net structures and sets are similar
Top-Down Mathematical Semantics and Symbolic Execution
Sur La Complexité D'un Problème De Codage
An Operation with Languages Occurring in the Linguistic Approach to the Management
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
Preface: Non-Classical Models of Automata and Applications VII
On extremal properties of the Fibonacci word
Minimal NFA and biRFSA Languages
Disjunctive Languages and Compatible Orders
Nonuniform Complexity Classes Specified by Lower and Upper Bounds
How expressions can code for automata
Hyper-minimizing minimized deterministic finite state automata
On abelian versions of critical factorization theorem
Genralized Cancellation-And-Permutation Properties, Regular Languages and Supports of Rational Series
Factoring and testing primes in small space
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm
CPO-Models for Second Order Lambda Calculus with Recursive Types and Subtyping
Recursive algorithm for parity games requires exponential time
Gate circuits in the algebra of transients
On Christoffel classes
Circular splicing and regularity
Infinite words containing squares at every position
Strongly locally testable semigroups with commuting idempotents and related languages
Tours de Hanoï et automates
Topologies on Free Monoids Induced by Families of Languages
Meta-Heuristic Algorithms for Quasi Total Double Roman Domination Problem
On restarting automata with auxiliary symbols and small window size
Normalization of place/transition-systems preserves net behaviour
Compositional representation of rational functions
Sorting with a popqueue
Two-dimensional Sgraffito automata
Each Regular Code Is Included in A Maximal Regular Code
Reduction Semantics for Rational Schemes
Langages Algébriques Déterministes Non Générateurs
Generalizations of Parikh mappings
Total edge-vertex domination
Sémantique du parallélisme et du choix du langage electre
Remarks on DOL Growth Sequences
Locally catenative sequences and Turtle graphics
On Continuous Functions Computed by Finite Automata
Division in logspace-uniform NC 1
A compositional approach to synchronize two dimensional networks of processors
The simplest binary word with only three squares
Similarity relations and cover automata
Human-verifiable proofs in the theory of word-representable graphs
Holonomic Functions and Their Relation to Linearly Constrained Languages
Enumeration of bordered words. Le langage de la vache-qui-rit
Fast and correctly rounded logarithms in double-precision
Two-Way Multihead Automata Over a One-Letter Alphabet
Synchronized EOL Forms Under Uniform Interpretation
A Lower Bound For Reversible Automata
Sur Les Ensembles Linéaires
Regularity of languages defined by formal series with isolated cut point
Über die Implementierung Redundanzfreier Codes zur Datenverschlüsselung
Monoid presentations of groups by finite special string-rewriting systems
Asymptotics of Z-convex polyominoes
Thread algebra for noninterference
Reduction in non-( k + 1)-power-free morphisms
Updating Approximately Complete Trees
Polynomial languages with finite antidictionaries
Some decompositions of Bernoulli sets and codes
Minimal generators of submonoids of A infinity
Binary words avoiding the pattern AABBCABBA
Edge-bipancyclicity in conditional edge-faulty k -ary n -cubes
A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap
Calculs Ascendants du Programme d'Ackermann: Analyse du Programme de J. Arsac
Some Remarks on Multihead Automata
Une Formalisation des Systèmes Conversationnels
Hierarchies of function classes defined by the first-value operator
Extending the lambda-calculus with unbind and rebind
A Formalism for Treating Equivalence of Recursive Procedures
The strong independence of substitution and homomorphic replication
The entropy of Lukasiewicz-languages
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists
Preface: Non-classical models of automata and applications VIII
A weighted HP model for protein folding with diagonal contacts
The Pseudovariety J is Hyperdecidable
Conditional Lindenmayer systems with subregular conditions: The non-extended case
Une extension d'un théorème de P. Jullien sur les âges de mots
The accessibility of an access structure
Prolog infinite trees and automata
On the Analysis of Petri Nets and their Synthesis from Process Languages
Parallélisation sémantique
Arbitrary Weight Changes in Dynamic Trees
Decidability of the HD0L ultimate periodicity problem
Defect theorem in the plane
Outils et Résultats Pour Les Transducteurs Boustrophedons
Propriétés de complexité pour une famille d'algorithmes de Markov
Periodicity and roots of transfinite strings
Automates et code zigzag
Detecting the Morphic Images of a Word: Improving the General Algorithm
On characteristic formulae for Event-Recording Automata
Transducing by observing length-reducing and painter rules
Real Time Recognition with Cellular Automata: A Meaningful Example
One-way communication complexity of symmetric Boolean functions
Solides non organisés: definition, implantation et plongement
Integers with a maximal number of Fibonacci representations
Object oriented institutions to specify symbolic computation systems
An Algorithm for Finding A Minimal Recursive Path Ordering
Critical factorisation in square-free words
Deux Proprietes Combinatoires du Langage de Lukasiewicz
Adhesive and quasiadhesive categories
On a paper by Castelli, Mignosi, Restivo
Unique decipherability in the additive monoid of sets of numbers
Idealized coinductive type systems for imperative object-oriented programs
Binary patterns in binary cube-free words: Avoidability and growth
Automates Boustrophedon, Semi-Groupe de Birget et Monoide Inversif Libre
A Probabilistic Analysis of a New Satisfiability Algorithm
On z-submonoids and z-codes
Enumerating Davenport-Schinzel sequences
On the Horton-Strahler Number for Random Tries
Coproducts of Ideal Monads
Codes Et Motifs
Closure properties of hyper-minimized automata
On the Horton-Strahler number for combinatorial tries
Finite repetition threshold for large alphabets
New applications of the wreath product of forest algebras
A Fast Method of Deadlock Avoidance
Some Algebraic Properties of Machine Poset of Infinite Words
Galois lattice as a framework to specify building class hierarchies algorithms
On rationally controlled one-rule insertion systems
When is the orbit algebra of a group an integral domain? Proof of a conjecture of P.J. Cameron
Two extensions of system ${\mathsf F}$ with (co)iteration and primitive (co)recursion principles
Finiteness Results on Rewriting Systems
Charakterisierung Redundanzfreier Codes zur Datenverschlüsselung
A Hierarchy of primitive recursive sequence functions
Pruning and measures of uncertainty
Some further remarks on the family of finite index matrix languages
Automata, Borel functions and real numbers in Pisot base
Approximation algorithms for the Traveling Salesman Problem with range condition
A Note on a Conjecture of Duval and Sturmian Words
Study of irreducible balanced pairs for substitutive languages
Extended Primitive Recursive Functions
Towards using the history in online computation with advice
Les automates circulaires biaisés vérifient la conjecture de Cerný
Théorie des magmoïdes
Asymptotic Behaviour of Univariate and Multivariate Absorption Distributions
Point-Fixe Sur Un Ensemble Restreint
The limiting common distribution of two leaf heights in a random brinary tree
Periodicity Problem of Substitutions over Ternary Alphabets
On the distribution of characteristic parameters of words
An Economical Transformation of Graph Grammars
Un Principe de Résolution en Logique Modale
Call-by-value Solvability
On Temporal Program Verification Rules
Compositional characterization of observable program properties
Dejean's conjecture holds for $\sf {N\ge 27}$
Systolic Tree Acceptors
Factorisation des polynômes à plusieurs entiers
Foreword ICTCS 2010 special issue
Theory as Basis for Advances in Hypermedia
Two-variable word equations
A test-set for k-power-free binary morphisms
Closure Properties of Certain Families of Formal Languages with Respect to a Generalization of Cyclic Closure
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification
Finite Completion of comma-free codes. Part 1
A finite axiomatization of nondeterministic regular expressions
Episturmian words: a survey
On multiplicatively dependent linear numeration systems, and periodic points
On the Structure of General Stochastic Automata
Free group languages: Rational versus recognizable
Fairness and Regularity for Sccs Processes
The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation
Chronique sur la théorie de l'information
Calculs approchés de la borne inférieure de valeurs réparties
Construction of a deterministic -automaton using derivatives
Complexity classes for membrane systems
On the expressive power of the shuffle operator matched with intersection by regular sets
Undecidability of infinite post correspondence problem for instances of Size 9
On the product of balanced sequences
A note on dual approximation algorithms for class constrained bin packing problems
On Some Path Problems on Oriented Hypergraphs
Associative closure and periodicity of $\omega $-words
Efficient counting of k -convex polyominoes
One-relation languages and code generators
A Fully Equational Proof of Parikh's Theorem
A Better bound of randomized algorithms for the multislope ski-rental problem
On a complete set of operations for factorizing codes
Automatic sequences of rank two
Algebraic Complexity of Path Problems
Cutwidth of the Bruijn Graph
Syntactic Congruences and Syntactic Algebras
Independent Instances for Some Undecidable Problems
Finding automatic sequences with few correlations
Encoding FIX in object calculi
Algorithme quadratique de calcul de la solution général d'équation en mots à une variable
Abelian pattern avoidance in partial words
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines
Atoms and partial orders of infinite languages
Un sous-ensemble intéressant du français
Optimal strategy synthesis for request-response games
Search Trees and Bubble Memories
Pure interpretations for EOL forms
A Property of Biprefix Codes
Énumération des cartes pointées sur la bouteille de Klein
Connectedness of fractals associated with Arnoux-Rauzy substitutions
Randomized generation of error control codes with automata and transducers
Hierarchies and reducibilities on regular languages related to modulo counting
Complexity of lambda-term reductions
Interval exchanges, admissibility and branching Rauzy induction
Theories of orders on the set of words
Two-way representations and weighted automata
La Réduction Des Réseaux, Autour De L'Algorithme De Lenstra, Lenstra, Lovász
On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes
Approximation de Séries Formelles Par des Séries Rationnelles
On the number of squares in partial words
Ogden's Lemma for Nonterminal Bounded Languages
How much Semigroup Structure is Needed to Encode Graphs?
Algebraic tools for the construction of colored flows with boundary constraints
A little more about morphic Sturmian words
Some Results On Finite Maximal Codes
Characterizations of the Dyck Sets
A Selection Property of the Boolean µ-Calculus and Some of its Applications
An upper bound on the complexity of recognizable tree languages
Méthode Axiomatique Pour Les Propriétés De Fatalité Des Programmes Parallèles
How to build billiard words using decimations
Dynamic overloading with copy semantics in object-oriented languages: a formal account
Undecidable Event Detection Problems for Odes of Dimension One and Two
First-order properties of trees, star-free expressions, and aperiodicity
Explicit values of a q -multiple zeta-star function at roots of unity
Complexity of boundary graph languages
A hierarchy for circular codes
On dot-depth two
Bottom-Up derivatives of tree expressions
A metric for evaluating software architecture and communication models consistency
Analysis of Quickselect: An Algorithm for Order Statistics
On synchronized sequences and their separators
A Note on Equal Powers of Word Morphisms
Sur les termes nuls d'une suite récurrente cubique
On distributive fixed-point expressions
The weak circular repetition threshold over large alphabets
Palindromes in infinite ternary words
From LL -Regular to LL (1) Grammars: Transformations, Covers and Parsing
A space lower bound for acceptance by one-way II 2 -alternating machines
Lower Bounds for Las Vegas Automata by Information Theory
Une remarque sur les systèmes complets d'identités rationnelles
A general framework for the derivation of regular expressions
Binary operations on automatic functions
µ-Bicomplete Categories and Parity Games
On automatic infinite permutations
Factorisation des Polynomes a Plusieurs Variables
Standard factors of Sturmian words
A Unified Approach to Control Problems in Discrete Event Processes
On Searching for Roots of a Polynomial in a Circular Annulus
Immunity and simplicity for exact counting and other counting classes
The Separability of Formal Languages
Learning discrete categorial grammars from structures
Exemples de classes d'automates cellulaires
Root clustering of words
Sur Une Classe De Transformations D'Arbres
Logic and Functional Programming by Retractions: Operational Semantics
A Pumping Theorem for Deterministic Etol Languages
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping
Les Modalités de la Correction Totale
Bisections Reconnaissables
Finite Degrees of Ambiguity in Pattern Languages
Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
Complete subgraphs of bipartite graphs and applications to trace languages
Some results on complexity of µ-calculus evaluation in the black-box model
Almost all Classical Theorems are Intuitionistic
Formally certified floating-point filters for homogeneous geometric predicates
A More Efficient Notion of Zigzag Stability
Conversion of regular expressions into realtime automata
Normal forms for unary probabilistic automata
The structure of index sets and reduced indexed grammars
Fair Expressions and Regular Languages over Lists
Complexité de la réduction en logique combinatoire
Une Heuristique pour le Calcul de l'Indice de Transitivité d'un Tournoi
Hypergraph Systems and Their Extensions
The cyclicity problem for the images of Q-rational series
On a subclass of context-free groups
Topologies for Finite Words: Compatibility with the Cantor Topology
Une Application des Notions de Centre et Index Rationell a Certains Langages Algébriques
Sémantique algébrique de l'appel par valeur
The inclusion structure of partially lossy queue monoids and their trace submonoids
Pour en finir avec la dérécursivation du problème de Tours de Hanoï
A Game of Composing Binary Relations
Quantum finite automata with control language
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
Commutative images of rational languages and the Abelian kernel of a monoid
Optimal On-Line Coloring of Circular Arc Graphs
Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
On the computation of covert channel capacity
Une condition impliquant toutes les identités rationnelles
Hotz-Isomorphism Theorems In Formal Language Theory
Congestion optimale du plongement de l'hypercube H(n) dans la chaîne P (2 n )
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
Composition/décomposition de réseaux de petri et de leurs graphes de couverture
The Local And Global Varieties Induced by Nilpotent Monoids
On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage
On the hierarchies of $\Delta^0_2$-real numbers
On differentiation functions, structure functions, and related languages of context-free grammars
Langages d'Interpretation des Schemas Recursifs
Pebbling Dynamic Graphs in Minimal Space
Une Charpente De Semi-Unification
Un Réseau Linéaire Pour La Reconnaissance Des Mots Sans Carré
On sequences defined by D0L power series
Token Transfer in a Faulty Network
The Hamilton Circuit Problem on Grids
A Normal Form for Restricted Exponential Functions
On-line finite automata for addition in some numeration systems
On the Complexity of the Generalized Fibonacci Words
Domain µ-calculus
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique
Limiting Recursion and the Arithmetic Hierarchy
Exact and Asymptotic Distributions in Digital and Binary Search Trees
Histoire de fichiers
Logic and Functional Programming by Retractions
On the parallel complexity of linear groups
An algorithm for deciding if a polyomino tiles the plane
Strong functors and interleaving fixpoints in game semantics
Palindromic complexity of infinite words associated with non-simple Parry numbers
Affine Parikh automata
Bouquets of circles for lamination languages and complexities
On the number of dissimilar pfaffian orientations of graphs
Solving Algebraic Equations Using Coalgebra
Fixed points of endomorphisms of certain free products
A propos de l'optimalité des algorithmes numériques: étude du calcul de x"
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
Note on occurrences of factors in circular words
Tilings by 1 × 1 and 2 × 2
A note on coinduction and weak bisimilarity for while programs
On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers
Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander
On-Line Evaluation of Powers Using Euclid's Algorithm
Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses
On minimal Hamming compatible distances
Algebraic Definition of a Functional Programming Language and Its Semantic Models
Hopcroft's algorithm and tree-like automata
Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars
Extending regular expressions with homomorphic replacement
Algebraic Characterisations of Ntime(F) and NTime(F, A)
On Simple Matrix Languages Versus Scattered Context Languages