yusuke1997/dblp-id-title huggingface dataset:
Solving Parity Games Using an Automata-Based Algorithm
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract
Approximate Hashing for Bioinformatics
Two-Way Machines and de Bruijn Words
CoInductive Automata Algorithms
The Automata Theory Package omega
Implementation of Dictionaries via Automata and Decision Trees
Symbolic Dynamics, Flower Automata and Infinite Traces
State Complexity of Concatenation and Complementation of Regular Languages
Adaptive Automata - A Revisited Proposal
Automata for Pro-V Topologies
Transducing Reversibly with Finite State Machines
A BDD-Like Implementation of an Automata Package
A Summary of Some Discrete-Event System Control Problems
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings
Is this Finite-State Transducer Sequentiable?
Real-Time, Constant-Space, Constant-Randomness Verifiers
XML Schema Containment Checking Based on Semi-implicit Techniques
Derivatives for Enhanced Regular Expressions
Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers
Relational String Verification Using Multi-track Automata
Weighted Automata and Weighted Logics with Discounting
Deterministic Counter Machines and Parallel Matching Computations
Homomorphisms on Graph-Walking Automata
Multi-grain Relations
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels
In Memoriam Sheng Yu
On the Power of One-Way Automata with Quantum and Classical States
One-Counter Automata for Parsing and Language Approximation
Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata
On the Hierarchy of Block Deterministic Languages
Structurally Unambiguous Finite Automata
Lambda-Confluence Is Undecidable for Clearing Restarting Automata
Implementing WS1S via Finite Automata
Classical and Quantum Counter Automata on Promise Problems
Compact Representation for Answer Sets of n-ary Regular Queries
Around Hopcroft's Algorithm
Sweep Complexity Revisited
On the Complexity of Hopcroft's State Minimization Algorithm
The Bottom-Up Position Tree Automaton and Its Compact Version
DAWG versus Suffix Array
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
Minimization of Non-deterministic Automata with Large Alphabets
Implementation of Code Properties via Transducers
State Complexity of Overlap Assembly
Cascade Decompositions are Bit-Vector Algorithms
Are Statecharts Finite Automata?
Universal First-Order Quantification over Automata
Constructing Compact BPE Token DFAs
Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings
Efficient Parsing Using Filtered-Popping Recursive Transition Networks
Whale Calf, a Parser Generator for Conjunctive Grammars
Decision Problems for Restricted Variants of Two-Dimensional Automata
Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings
On the Regularity and Learnability of Ordered DAG Languages
A Challenging Family of Automata for Classical Minimization Algorithms
Multi-Return Macro Tree Transducers
Restricting the Use of Auxiliary Symbols for Restarting Automata
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
Variations of the Separating Words Problem
Nondeterministic Complexity of Operations on Closed and Ideal Languages
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton
Distributed Event Clock Automata - Extended Abstract
Minimal Partial Languages and Automata
Regular Ideal Languages and Their Boolean Combinations
BSP: A Parsing Tool for Ambiguous Regular Expressions
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
Using Automata to Describe Self-Assembled Nanostructures
State Complexity and the Monoid of Transformations of a Finite Set
Reducing Acyclic Cover Transducers
Deterministic Pushdown Automata and Unary Languages
Prime Decompositions of Regular Prefix Codes
Finite Automata Encoding Geometric Figures
Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers
Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers
Cellular Automata for Crowd Dynamics
Enumerated Automata Implementation of String Dictionaries
Automata for Codes
Ternary Equational Languages
On Parallel Implementations of Deterministic Finite Automata
Approximating Minimum Reset Sequences
Lessons from INR in the Specification of Transductions
Parametric Weighted Finite Automata for Figure Drawing
Bisimulation Minimization of Tree Automata
Automata on Words
Minimal Separating Sets for Muller Automata
Strong Retiming Equivalence of Synchronous Schemes
Hyper-Minimization in O(n2)
State Complexity of the Minimal Star Basis
Language Decompositions, Primality, and Trajectory-Based Operations
The Effect of Rewriting Regular Expressions on Their Accepting Automata
Games for Temporal Logics on Trees
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set
Approximating Dependency Grammars Through Intersection of Regular Languages
Factorization of Ambiguous Finite-State Transducers
Types of Trusted Information That Make DFA Identification with Correction Queries Feasible
Shape Preserving Tree Transducers
Pseudo-minimal Transducers: A Transducer with Proper Elements
Dynamically Weighted Tree Transducers
An O(n 2 ) Algorithm for Constructing Minimal Cover Automata for Finite Languages
Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression
Pattern Matching in DCA Coded Text
A Note on a Tree-Based 2D Indexing
Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers
State-Freezing Pushdown Automata
Preliminary Experiments in Hardcoding Finite Automata
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels
The Pumping Lemma for Regular Languages is Hard
TAGED Approximations for Temporal Properties Model-Checking
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars
Automata and Logics for Concurrent Systems: Five Models in Five Pages
Reducing the Time Complexity of Testing for Local Threshold Testability
Solving Complex Problems Efficiently with Adaptive Automata
Teaching Theory of Computation with Tape Machines
Random Generation of Deterministic Tree (Walking) Automata
Online Stochastic Pattern Matching
In Orbit with MeSCaL: Higher in Concatenation and Navigational Hierarchies of Regular Languages
Dynamical Implementation of Nondeterministic Automata and Concurrent Systems
New Approaches for Context Sensitive Flash Codes
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
Edit-Distance of Weighted Automata
Implementation of Catalytic P Systems
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
A Hierarchy of Reversible Finite Automata
An Ambiguity Hierarchy of Weighted Context-Free Grammars
Backward and Forward Bisimulation Minimisation of Tree Automata
Multi-entry DFA with Reduced Initial States to Speedup Parallel Recognition
From Sequential Extended Regular Expressions to NFA with Symbolic Labels
Component Composition Preserving Behavioural Contracts Based on Communication Traces
WIA and Theory and Practice
FAdo and GUItar
Stamina: Stabilisation Monoids in Automata Theory
Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals
Animation of the Generation and Computation of Finite Automata for Learning Software
On the Semantics of Atomic Subgroups in Practical Regular Expressions
A General Weighted Grammar Library
On-the-Fly Stuttering in the Construction of Deterministic omega -Automata
Finite State Automata Representing Two-Dimensional Subshifts
Integrating Hands-on Work into the Formal Languages Course via Tools and Programming
Verified Verifying: SMT-LIB for Strings in Isabelle
Translation of Semi-extended Regular Expressions Using Derivatives
Alignment Distance of Regular Tree Languages
Fly-Automata, Their Properties and Applications
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations
Restarting Automata for Picture Languages: A Survey on Recent Developments
Ambiguity Hierarchies for Weighted Tree Automata
Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
Computational Linguistic Motivations for a Finite-State Machine Hierarchy
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers
Composed Bisimulation for Tree Automata
An Automata Approach to Match Gapped Sequence Tags Against Protein Database
Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings
Equivalence of Probabilistic \mu -Calculus and p-Automata
On the Size of Deterministic Finite Automata
Using Regular Grammars for Event-Based Testing
On Lazy Representations and Sturmian Graphs
Operations on DASG
Compressing XML Documents Using Recursive Finite State Automata
Generic epsilon -Removal Algorithm for Weighted Automata
Finite-State Molecular Computing
On the Square of Regular Languages
Boosting Pushdown and Queue Machines by Preprocessing
Determinization of Glushkov Automata
Simulating Two-Way Nondeterministic Finite Automata Over Small Alphabets by One-Way Nondeterministic Automata
Unary Language Concatenation and Its State Complexity
Operational Complexity in Subregular Classes
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents
On the Implementation of Compact DAWG's
On the Computation of Some Standard Distances Between Probabilistic Automata
The Interval Rank of Monotonic Automata
Generalizing the Discrete Timed Automaton
Symbolic Implementation of Alternating Automata
State Complexity of Basic Operations on Nondeterministic Finite Automata
Tools to Implement Automata, a First Step: ASTL
Experimental Study of the Shortest Reset Word of Random Automata
Regulated Nondeterminism in Pushdown Automata
Smaller Representation of Compiled Regular Expressions
Factor and Subsequence Kernels and Signatures of Rational Languages
On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment
Verifying Parallel Programs with Dynamic Communication Structures
Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings
Towards a Meta-Normal Form Algorithm for Context-Free Grammars
Is Learning RFSAs Better Than Learning DFAs?
On Parsing LL-Languages
Enhancing Approximations for Regular Reachability Analysis
Complexity of Sets of Two-Dimensional Patterns
Synchronizing Automata on Quasi-Eulerian Digraph
Computing Weights
Factor Oracles
Weak Inclusion for Recursive XML Types
Automata-Theoretic Techniques for Analyzing Infinite-State Systems
State of Büchi Complementation
On the Semantics of Regular Expression Parsing in the Wild
Complementable Normal Form of Parametrized Automata
Enhanced Ternary Fibonacci Codes
Minimal Unambiguous eNFA
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings
Progressive Solutions to FSM Equations
Decision Problems for Finite Automata over Infinite Algebraic Structures
Combining Regular Expressions with (Near-)Optimal Brzozowski Automata
SAT-Based Automated Completion for Reachability Analysis
Partially Ordered Two-Way Büchi Automata
From Ambiguous Regular Expressions to Deterministic Parsing Automata
Five Determinisation Algorithms
Deterministic Stack Transducers
Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images
A Survey on Automata with Translucent Letters
Automata, Probability, and Recursion
Partial Derivative and Position Bisimilarity Automata
Nondeterministic Moore Automata and Brzozowski's Algorithm
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Proving Sequential Function Chart Programs Using Automata
Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings
Towards Nominal Context-Free Model-Checking
Average Value and Variance of Pattern Statistics in Rational Models
From Regular Weighted Expressions to Finite Automata
Finite Automata for Generalized Approach to Backward Pattern Matching
Early Nested Word Automata for XPath Query Answering on XML Streams
Compiling Linguistic Constraints into Finite State Automata
On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
On Two-Dimensional Pattern Matching by Finite Automata
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
Binary Coded Unary Regular Languages
Decision Problems for Reversible and Permutation Automata
Engineering an LTL f Synthesis Tool
Smaller Representation of Finite State Automata
On Deterministic Catalytic Systems
Compressed Automata for Dictionary Matching
Attributed Tree Transducers for Partial Functions
Refinement of Near Random Access Video Coding with Weighted Finite Automata
Dynamic Programming - NFA Simulation
Synchronization of Automata with One Undefined or Ambiguous Transition
State Complexity of Reversals of Deterministic Finite Automata with Output
Generating Small Automata and the Černý Conjecture
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L
On the Boundary of Regular Languages
Synchronization Problems in Automata Without Non-trivial Cycles
Towards More Expressive 2D Deterministic Automata
PDFA Distillation with Error Bound Guarantees
Succinct Descriptions of Regular Languages with Binary +-NFAs
Observations on Determinization of Büchi Automata
How to Use Sorting Procedures to Minimize DFA
Weighted Restarting Automata as Language Acceptors
An Implementation of Deterministic Tree Automata Minimization
Reset Thresholds of Automata with Two Cycle Lengths
Approximate Periods with Levenshtein Distance
A Family of Algorithms for Non Deterministic Regular Languages Inference
The Longest Common Subsequence Problem A Finite Automata Approach
Regularly Extended Two-Way Nondeterministic Tree Automata
Algorithms and Training for Weighted Multiset Automata and Regular Expressions
A Similarity Measure for Formal Languages Based on Convergent Geometric Series
Substitutions, Trajectories and Noisy Channels
Formally Synthesising a Protocol Converter: A Case Study
Minimal Cover-Automata for Finite Languages
Syntactic Semiring and Language Equations
Implementing Sequential and Parallel Programs for the Homing Sequence Problem
Theory Inspired by Gene Assembly in Ciliates
A New Approach for Showing Termination of Parameterized Transition Systems
On Design and Analysis of Chemical Reaction Network Algorithms
Problems on Finite Automata and the Exponential Time Hypothesis
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata
Implicit Structures to Implement NFA's from Regular Expressions
Memoized Regular Expressions
M-equivalence of Parikh Matrix over a Ternary Alphabet
Self-verifying Predicates in Büchi Arithmetic
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits
Testability of Oracle Automata
Crossing the Syntactic Barrier: Hom-Disequalities for H 1 -Clauses
A Table Compression Method for Extended Aho-Corasick Automaton
Inside Vaucanson
Tabulation of Bidirectional Push Down Automata
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis
LR Parsing for Global Index Languages (GILs)
On String Matching in Chunked Texts
Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials
Bideterministic Automata and Minimal Representations of Regular Languages
Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints
Introducing Code Adviser: A DFA-driven Electronic Programming Tutor
Finite Automata and Non-self-Embedding Grammars
Implementation and Application of Automata - 20th International Conference, CIAA 2015, Umeå, Sweden, August 18-21, 2015, Proceedings
Minimalizations of NFA Using the Universal Automaton
Short Regular Expressions from Finite Automata: Empirical Results
Finite-State Transducer Cascade to Extract Proper Names in Texts
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language
NFA to DFA Transformation for Finite Languages
A New Method for Compiling Parallel Replacement Rules
Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings
Supernondeterministic Finite Automata
Invertible Transducers, Iteration and Coordinates
Extended Context-Free Grammars and Normal Form Algorithms
Computing All ℓ-Cover Automata Fast
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings
An Earley-Based Universal Error-Correcting Parser
Subsequence Matching and Analysis Problems for Automata with Translucent Letters
On Parsing and Condensing Substrings of LR Languages in Linear Time
Persistent Computations of Turing Machines
Weak Inclusion for XML Types
Timing Parameter Characterization of Real-Time Systems
Introducing VAUCANSON
Derived-Term Automata of Multitape Rational Expressions
Manipulation of Regular Expressions Using Derivatives: An Overview
SDFA: Series DFA for Memory-Efficient Regular Expression Matching
Program Analysis through Finite Tree Automata
Bounded Prefix-Suffix Duplication
Analytic Functions Computable by Finite State Transducers
Operations over Automata with Multiplicities
Finite Automata Accepting Star-Connected Languages
Two-Way Automata and Bounded Languages
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract)
A Logical Characterization of Small 2NFAs
Tighter Packed Bit-Parallel NFA for Approximate String Matching
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata
3-Way Composition of Weighted Finite-State Transducers
Antimirov and Mosses's Rewrite System Revisited
The Complexity of Fixed-Height Patterned Tile Self-assembly
A Testing Framework for Finite-State Morphology
Acyclic Automata with Easy-to-Find Short Regular Expressions
Thompson Digraphs: A Characterization
Two-Dimensional Pattern Matching Against Basic Picture Languages
The Removal of Weighted ε-Transitions
Weak Minimization of DFA - An Algorithm and Applications
A Package TESTAS for Checking Some Kinds of Testability
Time Series Forecasting by Finite-State Automata
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids
Reachability and Safety in Queue Systems
The Cut Operation in Subclasses of Convex Languages (Extended Abstract)
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
From Two-Way to One-Way Finite Automata - Three Regular Expression-Based Methods
Dolev-Yao Theory with Associative Blindpair Operators
Boolean Operations for Attribute-Element Constraints
Pushdown Machines for Weighted Context-Free Tree Translation
Visual Exploration of Generation Algorithms for Finite Automata on the Web
Measuring Power of Generalised Definite Languages
From Regular Expressions to Deterministic Finite Automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}$ States Are Necessary and Sufficient
Partial Derivative Automata Formalized in Coq
Linear Encoding Scheme for Weighted Finite Automata
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
Nondeterministic State Complexity of Site-Directed Deletion
On Bidirectional Deterministic Finite Automata
Two-Pass Greedy Regular Expression Parsing
Applications of Automata in XML Processing
Metric Lexical Analysis
The Cayley-Hamilton Theorem for Noncommutative Semirings
A Rational Design for a Weighted Finite-State Transducer Library
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets
Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata
Autographe: A Graphical Version of Automate
Reduced Power Automata
More on Language Families with a Decidable Pumping-Problem (Extended Abstract)
Complexity of Proper Prefix-Convex Regular Languages
Filters for Efficient Composition of Weighted Finite-State Transducers
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Energy Complexity of Regular Language Recognition
A Toolkit for Parikh Matrices
Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization
Applications of Finite-State Transducers in Natural Language Processing
Back to the Future: A Fresh Look at Linear Temporal Logic
Compositional Failure Detection in Structured Transition Systems
On the Complexity of Determinizing Monitors
A New Hierarchy for Automaton Semigroups
Finite Automata and Unions of Regular Patterns with Bounded Constant Segments
Deciding Synchronous Kleene Algebra with Derivatives
Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings
Complexity of Bifix-Free Regular Languages
New Finite Automaton Constructions Based on Canonical Derivatives
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties
Stochastic Context-Free Graph Grammars for Glycoprotein Modelling
A First Taste of MeSCaL, a Tool for Solving Membership Problems for Regular Languages
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
The Equivalence Problem of E-Pattern Languages with Regular Constraints Is Undecidable
In Vitro Implementation of Finite-State Machines
Automata Applications in Chip-Design Software
Efficient Implementation of Regular Languages Using R-AFA
An Efficient Null-Free Procedure for Deciding Regular Language Membership
Estimation of bispectral matrix for fluorescent objects
Hyperspectral crack detection in paintings
Artifact detection in gamut mapped images using saliency
A critical look to some contrast enhancement evaluation measures
An investigation of the perceived tactile properties using fabric images, videos, and real fabrics
Melon Crack Identification and Classification Using k-Means Clustering for Quality Inspection
Semi-supervised Tissue Segmentation of Histological Images
Producing two-component thermochromic pattern by means of offset printing
Illuminant estimation from uncalibrated multispectral images
Using fuzzy logic for analysis and optimization of color-difference databases
To develop a method of estimating spectral reflectance from camera RGB values
Validation of stereo vision based liver surface reconstruction for image guided surgery