yusuke1997/dblp-id-title huggingface dataset:
How to Find Long Maximal Exact Matches and Ignore Short Ones
Cuts in Regular Expressions
Developments in Language Theory - 24th International Conference, DLT 2020, Tampa, FL, USA, May 11-15, 2020, Proceedings
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words
From Linear Partitions to Parallelogram Polyominoes
Colonies as Systems of Turing Machines Without States
Algebraic and Topological Models for DNA Recombinant Processes
Computational Nature of Biochemical Reactions
DFAs and PFAs with Long Shortest Synchronizing Word Length
Extremal Words in the Shift Orbit Closure of a Morphic Sequence
On the Decidability of the Equivalence for k-Valued Transducers
Flip-Pushdown Automata: Nondeterminism Is Better than Determinism
A Game-Theoretic Characterization of Boolean Grammars
Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings
On tally languages and generalized interacting automata
Turn Complexity of Context-Free Languages, Pushdown andOne-Counter Automata
Weighted Symbolic Automata with Data Storage
On Decidability of Intermediate Levels of Concatenation Hierarchies
A Comprehensive Introduction to the Theory of Word-Representable Graphs
On a Binary Zigzag Operation
On Deterministic Finite Automata and Syntactic Monoid Size
Conjunctive Grammars Can Generate Non-regular Unary Languages
Membership and Finiteness Problems for Rational Sets of Regular Languages
Fractals, Dimension, and Formal Languages
Word Equations in the Context of String Solving
On Highly Repetitive and Power Free Words
Tree Automata in the Theory of Term Rewriting
Analysis of Symbol Statistics in Bicomponent Rational Models
On Normalish Subgroups of the R. Thompson Groups
The Boolean Closure of Linear Context-Free Languages
A Finitary-Language Semantics for Propositional Linear Temporal Logic
Prefix and Period Languages of Rational omega -Languages
Bisimulations and behaviour of nondeterministic automata
Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings
Branching Frequency and Markov Entropy of Repetition-Free Languages
Jumping Automata over Infinite Words
Words Guaranteeing Minimal Image
Infinite trajectories
Restricted Ambiguity of Erasing Morphisms
The Billaud Conjecture for ${|{\varSigma } |} = 4$, and Beyond
Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays)
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
Pointlike Sets and Separation: A Personal Perspective
A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples
On the Structure of Graphic DLI-Sets
Compositions of Constant Weighted Extended Tree Transducers
Basic Notions of Reaction Systems
Two Optimal Parallel Algorithms on the Commutation Class of a Word
On the Computation Power of Finite Automata in Two-dimensional Environments
Arithmetical Complexity of Infinite Words
Regular Splicing Languages Must Have a Constant
From Glushkov WFAs to Rational Expressions
On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying x 2 = x 3
Height Functions and Linear Languages
Site-Directed Deletion
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata
How to Remove the Look-Ahead of Top-Down Tree Transducers
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines
On State Complexity of Finite Word and Tree Languages
Language Equations with Complementation
Single-Stranded Architectures for Computing
*-Continuous Kleene ω-Algebras
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
A Pattern Logic for Automata with Outputs
Constructing Infinite Words of Intermediate Complexity
The Boolean Closure of Growing Context-Sensitive Languages
Mezei-Wright Theory on N-Subsets of an Algebra
On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)
Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract)
On the Dual Post Correspondence Problem
Cooperating distributed grammar systems with non-terminating components
Generalized One-Unambiguity
Slender matrix languages
An Undecidable Problem for Shuffle Languages
One-Way Multi-Head Finite Automata with Pebbles But No States
Characterizing Reduction Graphs for Gene Assembly in Ciliates
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
Complexity Theory for Splicing Systems
Two-Sided Bounds for the Growth Rates of Power-Free Languages
On complete sets of tree automata
Developments in Language Theory - 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings
A Family of p -Uniform Tag Systems for p -Paperfolding Sequences
Some New Decision Results for Edge Grammars
Lowering Undecidability Bounds for Decision Questions in Matrices
Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings
On Shrinking Restarting Automata of Window Size One and Two
Schützenberger and Eilenberg Theorems for Words on Linear Orderings
On the Maximum Coefficients of Rational Formal Series in Commuting Variables
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata
The Unambiguity of Segmented Morphisms
More Concise Representation of Regular Languages by Automata and Regular Expressions
Transfinite Lyndon Words
Subdirect Product Structure of Left Clifford Semigroups
Synchronizing Automata with Coinciding Cycles
Adding Nesting Structure to Words
The Synchronization Problem for Strongly Transitive Automata
An Analysis and a Reproof of Hmelevskii's Theorem
Complementation of Finitely Ambiguous Büchi Automata
Restarting automata, Church-Rosser languages, and representations of r.e. languages
Unambiguous Morphic Images of Strings
Some Open Problems in Polyomino Tilings
Undecidability and Finite Automata
On the complexity of computing the order of repetition of a string
Semi-rational Sets of DAGs
Context-Free Word Problem Semigroups
Chartering first order logic
Around Don's Conjecture for Binary Completely Reachable Automata
On the Complexity of Deciding Avoidability of Sets of Partial Words
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Squareable Words
Reduced Languages as omega -Generators
Geometrical OL-Systems Coming from Tilings of the Plane
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
A General Information Extraction Framework Based on Formal Languages
Traces of Control-Flow Graphs
Block Sorting-Based Transformations on Words: Beyond the Magic BWT
On Context-Free Languages of Scattered Words
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time
Suffixes, Conjugates and Lyndon Words
Programmed Grammar Systems
Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton
Point mutations in context-free languages
Developments in Language Theory - 23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, Proceedings
On Competence in CD Grammar Systems
Context-Dependent Nondeterminism for Pushdown Automata
Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings
Grammar-Based Tree Compression
Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Trace Languages Definable with Modular Quantifiers
Schützenberger Products in a Category
Acts over Right, Left Regular Bands and Semilattices Types
On Matching Generalised Repetitive Patterns
On Language Equations XXK = XXL and XM = N over a Unary Alphabet
Verifying and Interpreting Neural Networks Using Finite Automata
Computational Complexity of Decision Problems on Self-verifying Finite Automata
Operational State Complexity and Decidability of Jumping Finite Automata
Completely Distinguishable Automata and the Set of Synchronizing Words
Reducing Local Alphabet Size in Recognizable Picture Languages
The Pumping Lemma for Context-Free Languages is Undecidable
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
Complexity Analysis: Transformation Monoids of Finite Automata
Integer Weighted Automata on Infinite Words
3-Abelian Cubes Are Avoidable on Binary Alphabets
The Power of One-Letter Rational Languages
Rewriting Extended Regular Expressions
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
The Power Word Problem in Graph Products
Isometric Words Based on Swap and Mismatch Distance
What Do We Know About Language Equations?
Restricted Towers of Hanoi and Morphisms
On the Star Height of Rational Languages: A New Presentation for Two Old Results
Syntactic Semiring and Universal Automaton
Inexpressibility Results for Regular Languages in Nonregular Settings
On the Hausdorff Measure of omega-Power Languages
Reversible Top-Down Syntax Analysis
On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata
Self-organization in Cellular Automata: A Particle-Based Approach
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
Context-Sensitive Decision Problems in Groups
On the Number of Abelian Bordered Words
The Complexity of Regular(-Like) Expressions
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
Remarks on Well Quasi Orders of Words
Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers
On Commutative Asynchronous Automata
Separating Many Words by Counting Occurrences of Factors
Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells
Generalizations of Code Languages with Marginal Errors
Aperiodic String Transducers
Hairpin Finite Automata
Outfix-Guided Insertion - (Extended Abstract)
Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata
On-Line Odometers for Two-Sided Symbolic Dynamical Systems
On a Conjecture by Carpi and D'Alessandro
Some Examples of Semi-rational DAG Languages
Linking Algebraic Observational Equivalence and Bisimulation
On A Class of Hypercodes
Connecting Decidability and Complexity for MSO Logic
R-Trivial Languages of Words on Countable Ordinals
Polynomial Generators of Recursively Enumerable Languages
On the Average Number of States of Partial Derivative Automata
Simulation Relations for Alternating Parity Automata and Parity Games
Two Element Unavoidable Sets of Partial Words
Parallel Communicating Grammar Systems with Incomplete Information Communication
On Decision Problems for Simple and Parameterized Machines
On the Asymptotic Abelian Complexity of Morphic Words
Locally Consistent Parsing and Applications to Approximate String Comparisons
A Note on a Result of Daurat and Nivat
The Theory of Rational Relations on Transfinite Strings
Deque Languages, Automata and Planar Graphs
Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus
Iteration Conditions of W. Ogden's Type and Applications to Programming Languages (II)
Some Properties of Ciliate Bio-operations
Matrix Mortality and the Cerný-Pin Conjecture
From Synonymy to Self-Modifying Automata: Q-Diam Language
Computer Aided Synthesis: A Game-Theoretic Approach
Languages vs. ω -Languages in Regular Infinite Games
Diverse Palindromic Factorization Is NP-complete
On the Commutative Equivalence of Context-Free Languages
Recursive Constructions in the Theory of P.I. Algebras
Carathéodory Extensions of Subclasses of Regular Languages
Improved Bounds on the Number of Automata Accepting Finite Languages
Morphic Primitivity and Alphabet Reductions
Sturmian Graphs and a Conjecture of Moser
Networks of Watson-Crick D0L Systems
A Short Introduction to Infinite Automata
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
Reaction Systems: A Model of Computation Inspired by Biochemistry
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
Duplication Roots
Formal Languages and Arithmetic Theories: Recent Results and Open Problems
Finite State Recognizability for Two-Dimensional Languages: A Brief Survey
On the Periodicity of Morphic Words
Join Decompositions of Pseudovarieties of the Form DH ECom
Graph Spectral Properties of Deterministic Finite Automata - (Short Paper)
Bisimulation Minimisation for Weighted Tree Automata
Limited Automata and Unary Languages
Semirings: A basis for a mathematical automata and language theory
Multi-letter Reversible and Quantum Finite Automata
On Timed Scope-Bounded Context-Sensitive Languages
Characterizing DNA Bond Shapes Using Trajectories
Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata
Reachability Problems in Nondeterministic Polynomial Maps on the Integers
NFA Reduction Algorithms by Means of Regular Inequalities
Sequences with grouped factors
On the Complexity and Approximability of Bounded Access Lempel Ziv Coding
Context-Free Grammars and XML Languages
A Medvedev Characterization of Recognizable Tree Series
Space Complexity of Stack Automata Models
Words, Permutations, and Representations of Numbers
The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012
Special Factors of Sequences with Linear Subword Complexity
On the Balancedness of Tree-to-Word Transducers
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths
Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition
A Linear-Time Simulation of Deterministic d-Limited Automata
Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's
Recent Results on Sturmian Words
Dynamics of the Independence Number and Automata Synchronization
Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings
Semantic Interpretation of Ambiguous Statements, Represented in a Logical Form
Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings
On Critical Exponents in Fixed Points of Non-erasing Morphisms
Learning Rational Functions
Finite Automata Models of Quantized Systems: Conceptual Status and Outlook
Counting Subwords and Regular Languages
Two-Dimensional Languages and Recognizable Functions
On the Index of Pure Context-free Grammars and Languages
Classifying Non-periodic Sequences by Permutation Transducers
Fixed Point and Aperiodic Tilings
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Aperiodic Tilings and Entropy
On the Representability of Line Graphs
On Lexicalized Well-Behaved Restarting Automata That Are Monotone
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
A lower bound for a constant in Shallit's conjecture
Computation with Absolutely No Space Overhead
On the Complexity of Languages Definable by Hereditary Elementary Formal Systems
The Hardest LL(k) Language
The Myhill-Nerode Theorem for Recognizable Tree Series
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages
Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages
Abstract Families of Graphs
Consensus Game Acceptors
The Dynamics of Cellular Automata in Shift-Invariant Topologies
Some Petri Net Languages and Codes
Measuring Power of Locally Testable Languages
Subword complexity and periodicity in two or more dimensions
Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata
Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
Magic Numbers and Ternary Alphabet
The Average State Complexity of the Star of a Finite Set of Words Is Linear
Unary Language Operations and Their Nondeterministic State Complexity
Avoidability of Additive Cubes over Alphabets of Four Numbers
Finite Automata with Sets of Translucent Words
On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States
Bag Context Tree Grammars
Finite Automata on Unranked and Unordered DAGs
The Growth Ratio of Synchronous Rational Relations Is Unique
Aspects of N-Dimensional Lindenmayer Systems
Recompression: Word Equations and Beyond
Regular Languages Definable by Majority Quantifiers with Two Variables
A Note on Synchronized Automata and Road Coloring Problem
Palindromes in Sturmian Words
On the Interplay Between Babai and Černý's Conjectures
Input-Driven Pushdown Automata for Edit Distance Neighborhood
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings
Bidirectional parsing for linear languages
2-Visibly Pushdown Automata
The Avoidability of Cubes under Permutations
Set Augmented Finite Automata over Infinite Alphabets
Definable Transductions and Weighted Logics for Texts
Decidability of Right One-Way Jumping Finite Automata
Differences Between 2D Neighborhoods According to Real Time Computation
On Palindromic Length of Sturmian Sequences
Finite Automata with Advice Tapes
Two-Way Two-Tape Automata
Symmetry Groups of Infinite Words
Theory of Átomata
Finite Automata and the Writing of Numbers
Approximate Cartesian Tree Pattern Matching
Deciding Conjugacy of a Rational Relation - (Extended Abstract)
A Note on Rademacher Functions and Computability
Learning a Regular Tree Language from a Teacher
On Automatic Transitive Graphs
Homomorphisms Preserving Deterministic Context-Free Languages
An Approach to the Herzog-Schönheim Conjecture Using Automata
Szilard Languages Associated to Parallel Communicating Grammar Systems
Intersection Non-emptiness and Hardness Within Polynomial Time
Unambiguous Constrained Automata
On the Number of Rich Words
Large Simple Binary Equality Words
Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
A Decision Procedure for Reflexive Regular Splicing Languages
Semidirect Product Decompositions for Periodic Regular Languages
Two Dimensional Prefix Codes of Pictures
Visit-Bounded Stack Automata
Uniformization Problem for Variants of First Order Logic over Finite Words
On Language Inequalities XK subset of LX
On the power of one-way bounded cellular time computers
Proceedings of the 3rd International Conference Developments in Language Theory, DLT 1997, Thessaloniki, Greece, July 20-23, 1997
Repetitions in Kolakoski Sequence
Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata
Safety Verification for Two-Way Finite Automata with Monotonic Counters
A Strong Non-overlapping Dyck Code
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results
A Full Characterization of Bertrand Numeration Systems
Quotient Complexities of Atoms of Regular Languages
Checking Regular Invariance Under Tightly-Controlled String Modifications
When Is Reachability Intrinsically Decidable?
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
On First-Order Fragments for Words and Mazurkiewicz Traces
Deterministic OL Languages are of Very Low Complexity: DOL is in AC 0
Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings
Ciliate Bio-operations on Finite String Multisets
Deleting Automata with a Restart Operation
General Algorithms for Testing the Ambiguity of Finite Automata
Computing by Only Observing
Bit Catastrophes for the Burrows-Wheeler Transform
On the Computational Capacity of Parallel Communicating Finite Automata
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
The Domino Problem Is Undecidable on Every Rhombus Subshift
An Attribute Evaluation of One-Pass Attribute Grammars Using Value Estimate
Context-Freeness of Word-MIX Languages
Reconstructing Words from Right-Bounded-Block Words
Deleting String Rewriting Systems Preserve Regularity
Voronoi Cells of Beta-Integers
Repetition Avoidance in Circular Factors
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
Hairpin Completion with Bounded Stem-Loop
Adjacent Ordered Multi-Pushdown Systems
On the Non-deterministic Communication Complexity of Regular Languages
Deleting Deterministic Restarting Automata with Two Windows
Erasing in Petri Net Languages and Matrix Grammars
Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma * -Automata
Performing Regular Operations with 1-Limited Automata
A Unique Structure of Two-Generated Binary Equality Sets
The Inclusion Problem for Unambiguous Rational Trace Languages
A Structural Lemma for Deterministic Context-Free Languages
Bounding resources in Cooperating Distributed Grammar Systems
A General Approach to State Complexity of Operations: Formalization and Limitations
On Families of Full Trios Containing Counter Machine Languages
Compositions of Codings
Computing the k-binomial Complexity of the Thue-Morse Word
Languages with Mismatches and an Application to Approximate Indexing
Surminimisation of Automata
Weighted Tree Automata with Constraints
On the Simon's Congruence Neighborhood of Languages
Relative Prefix Distance Between Languages
Can Abstract State Machines Be Useful in Language Theory?
Error-Detecting Properties of Languages
Dense Completeness
Deciding Context Unification (with Regular Constraints)
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
The Boundary of Prefix-Free Languages
The Frobenius Problem and Its Generalizations
Additive Number Theory via Approximation by Regular Languages
Careful Synchronization of One-Cluster Automata
Iterative Reading of Numbers: The Ordered Case
Descriptional Complexity of Nondeterministic Finite Automata
On Tree Substitution Grammars
Relationally Periodic Sequences and Subword Complexity
Jumbled Scattered Factors
Time-Bounded Parallel Rewriting
Tree-Walking-Storage Automata
Universal Rewriting Rules for the Parikh Matrix Injectivity Problem
Solving Word Problems in Group Extensions over Infinite Words
Fine and Wilf's Theorem for k-Abelian Periods
Words of Minimum Rank in Deterministic Finite Automata
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata
Parikh Word Representable Graphs and Morphisms
Collapsing Words vs. Synchronizing Words
On Finite and Polynomial Ambiguity of Weighted Tree Automata
Tile Rewriting Grammars
Operational Characterization of Scattered MCFLs
Debates with Small Transparent Quantum Verifiers
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words
Yakyak: parsing with logical side constraints
Compositions of Tree-to-Tree Statistical Machine Translation Models
Resolution-Similar Graph Grammars
Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}
Borel Normality and Algorithmic Randomness
Complementation of Rational Sets on Countable Scattered Linear Orderings
Rule Space Transformations and One-Dimensional Cellular Automata
Balanced-By-Construction Regular and ømega-Regular Languages
Nodes Connected by Path Languages
Simulations over Two-Dimensional On-Line Tessellation Automata
On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts
A Study of a Simple Class of Modifiers: Product Modifiers
Graphs Capturing Alternations in Words
Decision Problems for Linear and Circular Splicing Systems
Powers of Regular Languages
Prefix Palindromic Length of the Sierpinski Word
A Combinatorial Property of Languages and Monoids
Transition Property for α-Power Free Languages with $\alpha \ge 2$ and $k\ge 3$ Letters
An Improvement of Iteration Lemmata for Context-free Languages
Rational Index of Languages with Bounded Dimension of Parse Trees
On Completely Reachable Automata and Subset Reachability
Equivalence of Linear Tree Transducers with Output in the Free Group