yusuke1997/dblp-id-title huggingface dataset:
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
Geometricity of Binary Regular Languages
MAT Learning of Universal Automata
Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks
Succinct Description of Regular Languages by Weak Restarting Automata
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
How Many Figure Sets Are Codes?
Solving Equations on Words with Morphisms and Antimorphisms
On the Synchronization of Planar Automata
The New Complexity Landscape Around Circuit Minimization
Average-Case Optimal Approximate Circular String Matching
Termination of Rule-Based Calculi for Uniform Semi-Unification
On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
Approximate Regular Expressions and Their Derivatives
Duplication-Loss Genome Alignment: Complexity and Algorithm
Cyclic Shift on Multi-component Grammars
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables
On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures
A Conditional Superpolynomial Lower Bound for Extended Resolution
Tiling the Plane with a Fixed Number of Polyominoes
Learnability of Automatic Classes
On Computability and Learnability of the Pumping Lemma Function
Minimization of Finite State Automata Through Partition Aggregation
On the Analysis of "Simple" 2D Stochastic Cellular Automata
On the Maximum Number of Distinct Palindromic Sub-arrays
Restricted Turing Machines and Language Recognition
Properties of Regular DAG Languages
On Bounded Languages and Reversal-Bounded Automata
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
A Logical Characterization for Dense-Time Visibly Pushdown Automata
Variable Automata over Infinite Alphabets
Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy
A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers
Default Logic and Bounded Treewidth
Succinct Representations for (Non)Deterministic Finite Automata
Unary Pattern Avoidance in Partial Words Dense with Holes
k-Petri Net Controlled Grammars
Matchings, Random Walks, and Sampling
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
Finitary Languages
Agreement and Cliticization in Italian: A Pregroup Analysis
Non-Zero Sum Games for Reactive Synthesis
Complete Variable-Length Codes: An Excursion into Word Edit Operations
String Extension Learning Using Lattices
Distinguishing Pattern Languages with Membership Examples
On the syllabification of words via go-through automata
Networks of Polarized Evolutionary Processors Are Computationally Complete
Reasoning with Prototypes in the Description Logic ALC ALC Using Weighted Tree Automata
Reversible Shrinking Two-Pushdown Automata
Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
Networks of Evolutionary Processors with Two Nodes Are Unpredictable
Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness
Avoidable Binary Patterns in Partial Words
Automata-Based Symbolic Representations of Polyhedra
First-order deduction in neural networks
Disturbance Decoupling in Finite Automata
A Graph Polynomial Approach to Primitivity
A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
Automaton Ranks of Some Self-similar Groups
Three Learnable Models for the Description of Language
From Words to Graphs, and Back
On Collapsing Prefix Normal Words
On the Capacity of Capacitated Automata
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
Dynamic Communicating Automata and Branching High-Level MSCs
On the Parikh Membership Problem for FAs, PDAs, and CMs
Compositions of Extended Top-down Tree Transducers
Interprocedural Information Flow Analysis of XML Processors
Insertion Operations on Deterministic Reversal-Bounded Counter Machines
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
Automatic Learning of Subclasses of Pattern Languages
Learning Sequential Tree-to-Word Transducers
Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem
Length Codes, Products of Languages and Primality
Complexity of Automatic Sequences
Measuring Information in Timed Languages
Boolean Algebras of Regular ω-Languages
An Oracle Hierarchy for Small One-Way Finite Automata
Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions
On the Number of Unbordered Factors
Pregroup Grammars with Letter Promotions
On the Complexity of Shortest Path Problems on Discounted Cost Graphs
Underlying Principles and Recurring Ideas of Formal Grammars
Counting Models of Linear-Time Temporal Logic
Multi-tilde Operators and Their Glushkov Automata
Preset Distinguishing Sequences and Diameter of Transformation Semigroups
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings
Model Learning as a Satisfiability Modulo Theories Problem
The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
Partially Directed Animals with a Bounded Number of Holes
Learning Conjunctive Grammars and Contextual Binary Feature Grammars
Bounded Hairpin Completion
Automaton-Based Array Initialization Analysis
P-NP Threshold for Synchronizing Road Coloring
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform
Abstract Numeration Systems
On SAT Representations of XOR Constraints
Hankel Matrices: From Words to Graphs (Extended Abstract)
Interval Temporal Logic Semantics of Box Algebra
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
Model Checking Buechi Specifications
Tree-Like Unit Refutations in Horn Constraint Systems
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees
On Stable and Unstable Limit Sets of Finite Families of Cellular Automata
Rule-based Word Spacing in Korean Based on Lexical Information Extracted from a Corpus
Two-Dimensional Palindromes and Their Properties
Computing with Catalan Families
Matching Trace Patterns with Regular Policies
On the State Complexity of Semi-quantum Finite Automata
A Randomized Numerical Aligner (rNA)
Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines
A Local Greibach Normal Form for Hyperedge Replacement Grammars
From Regular Tree Expression to Position Tree Automaton
Sorting Networks: The End Game
Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers
Normalization of Sequential Top-Down Tree-to-Word Transducers
Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars
A Cryptosystem Based on the Composition of Reversible Cellular Automata
Partial Derivatives of an Extended Regular Expression
Towards More Precise Rewriting Approximations
Geometrically Closed Positive Varieties of Star-Free Languages
Characterizing the Rational Functions by Restarting Transducers
On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function
On Limited Nondeterminism and ACC Circuit Lower Bounds
A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane
Constraint Satisfaction Problems: Complexity and Algorithms
Learning Unions of k-Testable Languages
Occurrence and Lexicographic Properties of Standard Sturmian Words
Quotient of Acceptance Specifications Under Reachability Constraints
On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)
Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
Extensions of the Caucal Hierarchy?
Unambiguous Boolean grammars
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
Unambiguous Automata Denoting Finitely Sequential Functions
Efficient Submatch Extraction for Practical Regular Expressions
Top-Down Tree Edit-Distance of Regular Tree Languages
Measuring Closeness Between Cayley Automatic Groups and Automatic Groups
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata
Ogden's Lemma for ET0L Languages
Bit-coded Regular Expression Parsing
Probabilistic ω-Regular Expressions
On the Complexity of Hard Enumeration Problems
Deterministic Biautomata and Subclasses of Deterministic Linear Languages
Undecidability of the State Complexity of Composed Regular Operations
Normal Form on Linear Tree-to-Word Transducers
Restarting Automata with Auxiliary Symbols and Small Lookahead
Deterministically and Sudoku-Deterministically Recognizable Picture Languages
Limited Two-Way Deterministic Finite Automata with Advice
Infiniteness and Boundedness in 0L, DT0L, and T0L Systems
Recurrence in Multidimensional Words
Locally Stratified Boolean Grammars
Deciding WQO for Factorial Languages
Automata for Ontologies
The Block Structure of Successor Morphisms
Reasoning on Schemas of Formulas: An Automata-Based Approach
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
A series of slowly synchronizable automata with a zero state over a small alphabet
Constructing Infinite Words of Intermediate Arithmetical Complexity
Efficient Translation with Linear Bimorphisms
Color War: Cellular Automata with Majority-Rule
Reversible Pushdown Automata
(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization
Fast Reversible Language Recognition Using Cellular Automata
Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets
On Finite-Index Indexed Grammars and Their Restrictions
Context-Sensitive Fusion Grammars Are Universal
Green's Relations and Their Use in Automata Theory
Partitioning Graphs into Induced Subgraphs
Canonizable Partial Order Generators
On Context-Diverse Repeats and Their Incremental Computation
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems
Equation x^iy^jx^k=u^iv^ju^k in Words
The Number of Convex Permutominoes
Complexity Issues of String to Graph Approximate Matching
Conservative Groupoids Recognize Only Regular Languages
Generalizations of One-Deterministic Regular Languages
On Observability of Automata Networks via Computational Algebra
Topology-based Geometric Modelling for Biological Cellular Processes
Accurate Approximate Diagnosability of Stochastic Systems
On Varieties of Ordered Automata
Categorial Module Grammars of Bounded Size have Finite Bounded Density
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
Learnability and Positive Equivalence Relations
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata
Reductions of matrices associated with nowhere-zero flows
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words
Complexity of Regex Crosswords
A Brief History of Strahler Numbers
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
XML Schema Management: A Challenge for Automata Theory
Channel Synthesis Revisited
Mix-Automatic Sequences
A Parameterized Complexity Tutorial
Periodic Generalized Automata over the Reals
Reachability Analysis of Pushdown Systems with an Upper Stack
Order Structures for Subclasses of Generalised Traces
Pushdown automata with cancellation and commutation-augmented pregroups grammars
Grammar-Based Compression in a Streaming Model
The Range of State Complexities of Languages Resulting from the Cut Operation
The Copying Power of Well-Nested Multiple Context-Free Grammars
Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
Transformation of Petri Nets into Context-Dependent Fusion Grammars
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Free Word-Order and Restarting Automata
Patterns with Bounded Treewidth
Formulae for Polyominoes on Twisted Cylinders
Not So Many Runs in Strings
State Complexity of Basic Operations Combined with Reversal
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
Homomorphic Characterizations of Indexed Languages
Catalytic Petri Nets Are Turing Complete
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP
Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings
Longest Common Extensions via Fingerprinting
On XOR Lemma for Polynomial Threshold Weight and Length
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard
Input Strictly Local Tree Transducers
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs
Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings
Computational Complexity of Dynamical Systems: the case of Cellular Automata
The Automatic Baire Property and an Effective Property of ømega-Rational Functions
Choosing Word Occurrences for the Smallest Grammar Problem
Hardness Results for Coverability Problem of Well-Structured Pushdown Systems
An Approach to Parallel Mildly Context-Sensitive Grammar Formalisms
Hierarchy and Expansiveness in 2D Subshifts of Finite Type
Frequent Pattern Mining with Non-overlapping Inversions
Modern Aspects of Complexity Within Formal Languages
Automata on Gauss Words
Arbology: Trees and Pushdown Automata
Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars
The Strong, Weak, and Very Weak Finite Context and Kernel Properties
Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
Planarity of Knots, Register Automata and LogSpace Computability
Well-Quasi-Ordering Hereditarily Finite Sets
Minimal Separating Sequences for All Pairs of States
Pomsets and Unfolding of Reset Petri Nets
Picture Codes with Finite Deciphering Delay
On Periodicity Lemma for Partial Words
Primitive Words Are Unavoidable for Context-Free Languages
Two-Way Automata Making Choices Only at the Endmarkers
Untestable Properties Expressible with Four First-Order Quantifiers
Simplifying DPDA Using Supplementary Information
The Complexity of Request-Response Games
Probabilistic Simulation for Probabilistic Data-Aware Business Processes
A Simple n -Dimensional Intrinsically Universal Quantum Cellular Automaton
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
Derivatives for Regular Shuffle Expressions
Some Minimality Results on Biresidual and Biseparable Automata
Recent Developments in Algorithmic Teaching
Weighted Degenerated Approximate Pattern Matching
Learners Based on Transducers
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
Picture Languages Generated by Assembling Tiles
Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings
The Computer Science of DNA Nanotechnology
Descriptive Complexity of the Hamming Neighborhood of a Regular Language
The Fault Tolerance of NP-Hard Problems
Proof-Based Synthesis of Sorting Algorithms for Trees
Counting Ordered Patterns in Words Generated by Morphisms
Decision Problems for Interval Markov Chains
Rational Selecting Relations and Selectors
Optional and Iterated Types for Pregroup Grammars
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg
On leftmost derivations in CD grammar systems
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
Absolute Convergence of Rational Series Is Semi-decidable
On the Arithmetics of Discrete Figures
Tight Bounds on the Minimum Size of a Dynamic Monopoly
Learnability of Co-r.e. Classes
2-Synchronizing Words
Toroidal Codes and Conjugate Pictures
On Alternating Phrase-Structure Grammars
Logics for Unordered Trees with Data Constraints on Siblings
Efficient List-Based Computation of the String Subsequence Kernel
Optimal Sorting Networks
Sequentiality of Group-Weighted Tree Automata
Lower Bounds for Generalized Quantum Finite Automata
Towards a Taxonomy for ECFG and RRPG Parsing
The Word Problem for HNN-extensions of Free Inverse Semigroups
Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings
The Power of Programs over Monoids in [inline-graphic not available: see fulltext]
Generalized Register Context-Free Grammars
A Note with Computer Exploration on the Triangle Conjecture
A Turing Machine Distance Hierarchy
Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings
Shift-Reduce Parsers for Transition Networks
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding
Recurrence Relations, Succession Rules, and the Positivity Problem
A Game Characterisation of Tree-like Q-resolution Size
Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring
Recognizable Series on Hypergraphs
Deterministic Input-Reversal and Input-Revolving Finite Automata
The Weight in Enumeration
Alternating Finite Automata with Limited Universal Branching
On the Computational Power of Affine Automata
A Simple and Efficient Universal Reversible Turing Machine
Converting Self-verifying Automata into Deterministic Automata
Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation
Advice Complexity of Online Coloring for Paths
Orbits of Abelian Automaton Groups
Formal Language Tools for Template-Guided DNA Recombination
LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications
Classification of String Languages via Tiling Recognizable Picture Languages
On Balanced Sequences and Their Asymptotic Critical Exponent
Covering Space in the Besicovitch Topology
Temporal Logics with Language Parameters
Syntactic Complexity of Ultimately Periodic Sets of Integers
How to Travel between Languages
Bounding Clique-Width via Perfect Graphs
Hopcroft's Algorithm and Cyclic Automata
Polynomial-Time Algorithms for Learning Typed Pattern Languages
Applying Tree Languages in Proof Theory
State Complexity of Nested Word Automata
On the Number of Closed Factors in a Word
Palindromic Subsequences in Finite Words
Reducing the Ambiguity of Parikh Matrices
On Periodicity of Generalized Two-Dimensional Words
Permutations Sorted by a Finite and an Infinite Stack in Series
Complexity of Road Coloring with Prescribed Reset Words
On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT
Termination of Priority Rewriting
Optimising Attractor Computation in Boolean Automata Networks
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms
Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
Avalanche Structure in the Kadanoff Sand Pile Model
The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line
On Regularity-Preservation by String-Rewriting Systems
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
Dynamics of Circuits and Intersecting Circuits
A Kleene Theorem for Forest Languages
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Preimage Problems for Reaction Systems
Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
Geometrical Closure of Binary V_3/2 Languages
Extended Two-Way Ordered Restarting Automata for Picture Languages
Cut Languages in Rational Bases
Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata
Linear Parsing Expression Grammars
Refinement and Consistency of Timed Modal Specifications
Convergence of Newton's Method over Commutative Semirings
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
Covering Pairs in Directed Acyclic Graphs
Coding Non-orientable Laminations
Automatic Presentations for Cancellative Semigroups
Two Equivalent Regularizations for Tree Adjoining Grammars
Consensual Definition of Languages by Regular Sets
Minimal Union-Free Decompositions of Regular Languages
About Universal Hybrid Networks of Evolutionary Processors of Small Size
A Calculus of Cyber-Physical Systems
Weight-Reducing Hennie Machines and Their Descriptional Complexity
Derivatives and Finite Automata of Expressions in Star Normal Form
Uniformisation of Two-Way Transducers
Detecting Useless Transitions in Pushdown Automata
Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Are Good-for-Games Automata Good for Probabilistic Model Checking?
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete
Monadic Datalog Tree Transducers
Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
Extending the Overlap Graph for Gene Assembly in Ciliates
Characterization of Star-Connected Languages Using Finite Automata
Analysing Complexity in Classes of Unary Automatic Structures
Undecidability of Operation Problems for T0L Languages and Subclasses
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $
On Hardest Languages for One-Dimensional Cellular Automata
Observation and Interaction - Invited Paper
On the Levenshtein Automaton and the Size of the Neighbourhood of a Word
Cadences in Grammar-Compressed Strings
Location Based Automata for Expressions with Shuffle
Using Sums-of-Products for Non-standard Reasoning
Online Matching of Multiple Regular Patterns with Gaps and Character Classes
State Complexity of Pseudocatenation
Unification Modulo Chaining
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
Polycyclic and Bicyclic Valence Automata
The Inclusion Problem for Regular Expressions
Online Computation of Abelian Runs
Inferring a Relax NG Schema from XML Documents
Equations: From Words to Graph Products
Complexity Dichotomy for Counting Problems
Prediction of Creole Emergence in Spatial Language Dynamics
The Minimum Entropy Submodular Set Cover Problem
Algebraic Tools for the Overlapping Tile Product
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects
A Hybrid Approach to Word Segmentation of Vietnamese Texts