yusuke1997/dblp-id-title huggingface dataset:
P Systems Working in the Sequential Mode on Arrays and Strings
Crucial Words for Abelian Powers
A Characterization of Infinite LSP Words
Power Semigroups and Polynomial Closure
Characterization of a word by its subwords
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
A characteristic language for rational omega-power
On Hairpin-Free Words and Languages
Tree-to-Graph Transductions with Scope
Substitution on Words and Languages
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata
Some New Results on Palindromic Factors of Billiard Words
Rich and Periodic-Like Words
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Joint Topologies for Finite and Infinite Words
Variations on the Post Correspondence Problem for Free Groups
Synchronizing Automata with a Letter of Deficiency 2
Generalizations of Checking Stack Automata: Characterizations and Hierarchies
Parallel BNLC Graph Grammars
On Counting Functions of Languages
Word Equations, Constraints, and Formal Languages
Morphic Sequences Versus Automatic Sequences
From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper)
Formal Power Series over Trees
Joint Spectral Characteristics: A Tale of Three Disciplines
Characterization of Valuation Rings and Valuation Semigroups by Semistar-Operations
State Complexity of Neighbourhoods and Approximate Pattern Matching
Zielonka DAG Acceptance and Regular Languages over Infinite Words
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
The Generalized Rank of Trace Languages
Weighted Automata and Weighted Logics on Infinite Words
Non-erasing Variants of the Chomsky-Schützenberger Theorem
k-Abelian Equivalence and Rationality
Bounded Languages Described by GF(2)-grammars
Avoiding Abelian Powers in Partial Words
Extended Multi Bottom-Up Tree Transducers
On the Size Complexity of Rotating and Sweeping Automata
Languages in Membrane Computing: Some Details for Spiking Neural P Systems
Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models
The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability
On the Frequency of Letters in Pure Binary Morphic Sequences
Computation = self-assembly + conformational change: toward new computing paradigms
Chop Operations and Expressions: Descriptional Complexity Considerations
Developments in Language Theory - 28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings
Lyndon Words Formalized in Isabelle/HOL
On Emptiness and Counting for Alternating Finite Automata
Caterpillars, context, tree automata and tree pattern matching
Presentations of Right Unitary Submonoids of Monoids
Pattern Mining Under Simon's Congruence
Universal Recursively Enumerable Sets of Strings
Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings
On the Complexity of 2-Monotone Restarting Automata
Branching Grammars: A Generalization of ET0L Systems
Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings
Subword Complexity and k-Synchronization
A Brief Excursion to Parity Games
A Remark about Quadratic Trace Equations
Left Quotients of Deterministic Context-Free Languages
From Two-Way Transducers to Regular Function Expressions
On Deterministic Ordered Restart-Delete Automata
On Computational Complexity of Set Automata
Recognisable Languages over Monads
Hierarchies of Petri Net Languages and a Super-Normal Form
Enumeration Formulæ in Neutral Sets
Rewriting Rules for Arithmetics in Alternate Base Systems
Morphic Characterizations in Terms of Insertion Systems with a Context of Length One
The Power of Tree Series Transducers of Type I and II
Operations on Unambiguous Finite Automata
On a Generalization of Standard Episturmian Morphisms
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy
A Functional Program for Regular Expressions Matching - Abstract of Invited Talk
(0, 1)-Total Pure Context-Free Grammars
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes?
Covering Problems from a Formal Language Point of View
On a Conjecture of Schnoebelen
Some Regular Languages That Are Church-Rosser Congruential
Complexity of Quantum Uniform and Nonuniform Automata
Colored Gauss and Tangent Codes on the Torus
Cantor Sets and Dejean's Conjecture
An Optimal Coding for Stochastic Context-Free Languages with Unique Derivation
The Mortality Threshold for Partially Monotonic Automata
Computing Blocker Sets for the Regular Post Embedding Problem
Further Results on Restarting Automata
Suffix Automata and Standard Sturmian Words
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings
On semilinearity in formal power series
Unambiguous Conjunctive Grammars over a One-Letter Alphabet
Some Decision Questions Concerning the Time Complexity of Language Acceptors
Pseudoperiodic Words
A Perfect Class of Context-Sensitive Timed Languages
Hidden Grammars
Efficient Transformations from Regular Expressions to Finite Automata
The Reversibility in Quantum Computation Theory
Factorization in Formal Languages
Exponential ambiguity of context-free grammars
Sturmian Words: Dynamical Systems and Derivated Words
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata
Tree Languages Recognizable by Regular Frontier Check
Models of Pushdown Automata with Reset
Closest Substring Problems for Regular Languages
Enumeration and Decidable Properties of Automatic Sequences
An Undecidability Result Concerning Periodic Morphisms
The Power of Maximal Parallelism in P Systems
Unary Coded NP-Complete Languages in ASPACE (log log n)
Complexity Theory Made Easy
Measuring Communication in Automata Systems - (Invited Paper)
Parsimonious Computational Completeness
Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations
A Coloring Problem for Sturmian and Episturmian Words
Generalized Derivations with Synchronized Context-Free Grammars
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines
Logics for Reversible Regular Languages and Semigroups with Involution
Positive Varieties of Lattice Languages
Size Complexity of Two-Way Finite Automata
On Distinguishing NC 1 and NL
Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata
Groups, Languages and Dendric Shifts
Universally Wheeler Languages
A Note on the Degree of Nondeterminism
On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities
Deterministic Ordered Restarting Automata that Compute Functions
Roots and Powers of Regular Languages
Weak cyclic forms of rw-automata
Hierarchies of Piecewise Testable Languages
Some Remarks on Automata Minimality
Central Sturmian Words: Recent Developments
Binomial Complexities and Parikh-Collinear Morphisms
On the Length of Shortest Strings Accepted by Two-Way Finite Automata
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
String Rewriting Sequential P-Systems and Regulated Rewriting
Projection for Büchi Tree Automata with Constraints Between Siblings
Synchronizing Automata with Random Inputs - (Short Paper)
Words and Patterns
Deciding FO 2 Alternation for Automata over Finite and Infinite Words
Eventually Safe Languages
On the Mother of All Automata: The Position Automaton
Indecomposable prefix codes and prime trees
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
Low-Level Tradeoffs between Reversals and Alternations
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees
One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report)
Preservation of Normality by Unambiguous Transducers
On Restricted Context-Free Grammars
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract)
Descriptional Complexity of Bounded Context-Free Languages
Efficient Subgraph Matching Within Cellular Hypergraphs
Some New Directions and Questions in Parameterized Complexity
The Runs Theorem and Beyond
On Lindenmayerian Series in Complete Semirings
Using Light to Implement Parallel Boolean Algebra
On the Power of Communication Structure for Distributive Generation of Languages
P Systems with Proteins on Membranes and Membrane Division
Alternative Automata Characterization of Piecewise Testable Languages
The Entropy of Lukasiewicz-Languages
Growth Properties of Power-Free Languages
Ultrametric Finite Automata and Turing Machines
Defect theorems for trees
Well-Founded Semantics for Boolean Grammars
An Automata Characterisation for Multiple Context-Free Languages
Scope-Bounded Pushdown Languages
Forbidden Factors and Fragment Assembly
Undecidability of Weak Bisimilarity for PA-Processes
Inherent Size Blowup in ω-Automata
Elementary Theory of Ordinals with Addition and Left Translation by omega
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
On Minimal Grammar Problems for Finite Languages
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
General Formal Systems
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
Boolean Algebras of Regular Languages
Key Agreement Protocol Securer than DLOG
On a Family of Codes with Bounded Deciphering Delay
Fife's Theorem Revisited
Distributed Pushdown Automata Systems: Computational Power
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Minimal and Hyper-Minimal Biautomata - (Extended Abstract)
On a Hierarchy of Languages with Catenation and Shuffle
Well Quasi-Orders Arising from Finite Ordered Semigroups
Decision Questions on Integer Matrices
Tissue P Systems with Minimal Symport/Antiport
Involution Solid and Join Codes
Cellular Automata with Polynomials over Finite Fields
On the Descriptional Complexity of Some Variants of Lindenmayer Systems
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
Mapped Exponent and Asymptotic Critical Exponent of Words
Residual Finite Tree Automata
Abelian Repetitions in Sturmian Words
A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning
About Duval's Conjecture
Two-Dimensional Sgraffito Automata
Jumping Petri Nets - Specific Properties
Revolving-Input Finite Automata
Asynchronous sliding block maps
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Recovering Strings in Oracles: Quantum and Classic
On the Power of Randomized Pushdown Automata
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
Subshifts, Languages and Logic
On the Tree of Binary Cube-Free Words
The State Complexity of Star-Complement-Star
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
On Transition Minimality of Bideterministic Automata
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
Neural Language Acceptors
Restarting Automata, Marcus Grammars and Context-Free Languages
Shuffle Quotient and Decompositions
On the Density of Context-Free and Counter Languages
Counter-Free Automata, First-Order Logic and Star-Free Expressions
New problems of pattern avoidance
Valuated and Valence Grammars: An Algebraic View
Regular Languages Generated by Reflexive Finite Splicing Systems
On Some Variations of Two-Way Probabilistic Finite Automata Models
Never Minimal Automata and the Rainbow Bipartite Subgraph Problem
Rational and Algebraic Languages with Distributed Catenation
Abelian Primitive Words
Hierarchies of String Languages Generated by Deterministic Tree Transducers
The Root of a Language and Its Complexity
Fast Detection of Specific Fragments Against a Set of Sequences
Decidable Properties of 2D Cellular Automata
Post Correspondence Problem and Small Dimensional Matrices
Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings
State Complexity of Union and Intersection of Finite Languages
Deterministic Reconstruction of Context-Free Derivations for a Sentence with Shuffled Terminal Symbols
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
Regular Hedge Language Factorization Revisited
Finite Completion of Comma-Free Codes. Part I
Operator Precedence ω-Languages
Bounds on Powers in Strings
A Tale of Conjunctive Grammars
On the State Complexity of Operations on Two-Way Finite Automata
Semigroups with a Context-Free Word Problem
Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Logic and Languages of Higher-Dimensional Automata
Automata: From Uncertainty to Quantum
Right and left strongly locally testable semigroups and languages
Coding Partitions: Regularity, Maximality and Global Ambiguity
Experimental Quantum Computation with Molecules
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
Adding Monotonic Counters to Automata and Transition Graphs
Learning String Adjunct and Tree Adjunct Languages
A Comparative Analysis of Deletion Closure Operations and Their Properties
On the Existence of Minimal beta -Powers
Simulations by Time-Bounded Counter Machines
On the Power of Permitting Semi-conditional Grammars
On Partition Limited OL Systems
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet
Noncanonical LALR(1) Parsing
On the Size of Two-Way Reasonable Automata for the Liveness Problem
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
DNA Computing and Its Implications for Theoretical Computer Science
Non-regular Maximal Prefix-Free Subsets of Regular Languages
An Extremal Series of Eulerian Synchronizing Automata
Multiparty Computations with a Deck of Cards
Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models
Hunting Redundancies in Strings
Periodicity in Tilings
A Ciliate Bio-operation and Language Families
Non-constructive Methods for Finite Probabilistic Automata
Active Learning of Sequential Transducers with Side Information About the Domain
Developments in Language Theory - 29th International Conference, DLT 2025, Seoul, South Korea, August 19-22, 2025, Proceedings
Input Products for Weighted Extended Top-Down Tree Transducers
Inside the Class of REGEX Languages
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms
State Complexity of Deletion
Cellular Automata, the Collatz Conjecture and Powers of 3/2
The Strong Equivalence of ETOL Grammars
Complementing Two-Way Finite Automata
Transforming a Single-Valued Transducer Into a Mealy Machine
Geometry and Dynamics of the Besicovitch and Weyl Spaces
Scattered Factor-Universality of Words
Generating Self-Affine Fractals by Collage Grammars
On the Solvability Problem for Restricted Classes of Word Equations
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers
Subregular Expressions with Two Operations
On Abelian Subshifts
The Orthogonality of Some Complexity Measures of Context-Free Languages
Inequalities for One-Step Products
Ergodic Infinite Permutations of Minimal Complexity
From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract)
Array Grammars with Prescribed Teams of Array Productions
Quantum Computing: 1-Way Quantum Automata
Factorizations and Universal Automaton of Omega Languages
On One-Counter Positive Cones of Free Groups
Innermost Termination of Context-Sensitive Rewriting
Test Sets for Large Families of Languages
An Efficient Computation of the Equation K -Automaton of a Regular K -Expression
Schema for Parallel Insertion and Deletion
Recognizability for Automata
Interval Exchange Words and the Question of Hof, Knill, and Simon
Decidability of Geometricity of Regular Languages
Unambiguous Büchi Is Weak
Decidability of code properties
Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings
A Characterization of Completely Reachable Automata
On F-Prime Solutions of the Post Correspondence Problem
On Perfect Coverings of Two-Dimensional Grids
Semidirect Products With the Pseudovariety of All Finite Groups
Unary Probabilistic and Quantum Automata on Promise Problems
Numeration Systems: A Link between Number Theory and Formal Language Theory
There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
Equivalence of Functions Represented by Simple Context-Free Grammars with Output
The Membership Problem for Unordered Vector Languages
Bispecial Factors in the Brun S-Adic System
Derivation Tree Analysis for Accelerated Fixed-Point Computation
On the Complexity of k-Piecewise Testability and the Depth of Automata
Weak Cost Register Automata Are Still Powerful
On Two-Way Transducers
Synchronizing Monotonic Automata
Timed Attribute Hypergraph Grammars and Their Based Properties
Unary Patterns with Permutations
Inclusion Problems for Patterns with a Bounded Number of Variables
Bidimensional Sturmian Sequences and Substitutions
How Powerful is Unconditional Transfer? - When UT meets AC
On Some Properties of the Language of 2-Collapsing Words
Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
On decidability of boundedness property for regular path queries
Weight Assignment Logic
Definability in the Infix Order on Words
A Sufficient Condition for Erasing Productions to Be Avoidable
Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper)
Some New Modes of Competence-Based Derivations in CD Grammar Systems
Polyregular Functions: Characterisations and Refutations
MSO Logic for Unambiguous Shared-Memory Systems
Proceedings of the International Colloquium on Words, Languages & Combinatorics III, Kyoto, Japan, March 14-18, 2000
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
Squares in Binary Partial Words
Infinite Snake Tiling Problems
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Automaton Representation of Linear Conjunctive Languages
New Results on Deterministic Sgraffito Automata
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
Fair First Languages and Parallel Programme Schemes
Eliminating Communication by Parallel Rewriting
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
Developments in Language Theory, At the Crossroads of Mathematics, Computer Science and Biology, Turku, Finland, 12-15 July 1993
Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999
Morphic Images of Gauss Codes
Ternary Square-Free Partial Words with Many Wildcards
On the decomposition of finite languages
On the Iterated Hairpin Completion
Cellular Automata: From Black-and-White to High Gloss Color
The Minimum Amount of Useful Space: New Results and New Directions
Some Remarks on Extended Reular Languages
Relativized Codes, Finite Decodability, and Bounded Languages
Factorization Forests
Equational Theories of Scattered and Countable Series-Parallel Posets
Extremal Binary PFAs in a Černý Family
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words
Eigenvalues and Transduction of Morphic Sequences
Local Equational Logic II
Branching-Time Temporal Logics with Minimal Model Quantifiers
Various Aspects of Finite Quantum Automata
Groups Whose Word Problems Are Accepted by Abelian G-Automata
Avoidability of Formulas with Two Variables
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing
Minimizing Finite Automata Is Computationally Hard
Recent Developments in Trace Theory
Visualization of Cellular Automata
Automata with Extremal Minimality Conditions
Weighted Timed MSO Logics
An Introduction to Context-free Text Grammars
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth
Left and Right Synchronous Relations
On Disjunctivity, Ultimate Periodicity and Ultimate Identity
Special factors in some combinational structures
On Left-Monotone Deterministic Restarting Automata
Routes and Trajectories
Well Quasi-orders in Formal Language Theory
Nondeterminism Degrees for Context-Free Languages
Complexity of Topological Properties of Regular omega-Languages
A Kleene Theorem for Languages of Words Indexed by Linear Orderings
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
The Relative Edit-Distance Between Two Input-Driven Languages
Provably Shorter Regular Expressions from Deterministic Finite Automata
On Regular Expression Proof Complexity
Deterministic omega-regular liveness properties
A Parsing Problem for Context-Sensitive Languages
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory
Computing Languages by (Bounded) Local Sets
Real-Time One-Way Pushdown Cellular Automata Languages
Mix Operation with Catenation and Shuffle
Deciding Atomicity of Subword-Closed Languages
Prime Decompositions of Regular Languages
On k-Abelian Palindromic Rich and Poor Words
On the Sentence Valuations in a Semiring
Information Distance and Applications
Definability Results for Top-Down Tree Transducers
Table-driven and context-sensitive collage languages
LR Parsing for Boolean Grammars
Restarting Automata and Their Relations to the Chomsky Hierarchy
Second-Order Logic over Strings: Regular and Non-regular Fragments
Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages
Proof Complexity of Pigeonhole Principles
Coinductive Algorithms for Büchi Automata
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$
End-Marked Maximal Depth-First Contextual Grammars
Two-Way Transducers with a Two-Way Output Tape
An Extension of Newton's Method to omega -Continuous Semirings
On Word-Representable and Multi-word-Representable Graphs
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals
Weighted versus Probabilistic Logics
Approaching Repetition Thresholds via Local Resampling and Entropy Compression
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars
The Exact State Complexity for the Composition of Root and Reversal
Automata on Series-Parallel Biposets
On Negative Bases
Minimization of Deterministic Bottom-Up Tree Transducers
The State Complexity of Lexicographically Smallest Words and Computing Successors
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory
Inner Palindromic Closure
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
Regular and Context-Free Pattern Languages over Small Alphabets
The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency
Breadth-First Serialisation of Trees and Rational Languages - (Short Paper)
Imposing Vertical Context Conditions on Derivations
On Centralized PC Grammar Systems with Context-Sensitive Components
Nondeterminism Makes Unary 1-Limited Automata Concise
Biautomata for k-Piecewise Testable Languages
Semantic Shuffle on and Deletion Along Trajectories
Tree Codes and Equations
Two-Level Distributed H Systems
An NP-Complete Fragment of LTL
Synchronization of Parikh Automata
A Fresh Approach to Learning Register Automata
Weighted Automata and Logics on Infinite Graphs
Characteristic Semigroups of Directable Automata