yusuke1997/dblp-id-title huggingface dataset:
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers
Automata of Asynchronous Behaviors
Does o-Substitution Preserve Recognizability?
Nominal Automata for Resource Usage Control
Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability
Benchmarking Regular Expression Matching
Incremental and Semi-incremental Construction of Pseudo-Minimal Automata
On the Length of Homing Sequences for Nondeterministic Finite State Machines
Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
The Structure of Subword Graphs and Suffix Trees of Fibonacci Words
Simulation of Gate Circuits in the Algebra of Transients
Deeper Connections Between LTL and Alternating Automata
Subword Metrics for Infinite Words
Synchronizing Automata Preserving a Chain of Partial Orders
Direct Construction of Minimal Acyclic Subsequential Transducers
Boolean Kernels of Context-Free Languages
Efficient Enumeration of Regular Languages
Robust Parsing Using Dynamic Programming
Automata-Based Representations for Arithmetic Constraints in Automated Verification
On 25 Years of CIAA Through the Lens of Data Science
On Positive TAGED with a Bounded Number of Constraints
The Language, the Expression, and the (Small) Automaton
Deterministic Caterpillar Expressions
The Finite State Automata's Design Patterns
Shorter Regular Expressions from Finite-State Automata
Operations on Extended Automata
Regional Finite-State Error Repair
Prime Normal Form and Equivalence of Simple Grammars
Brzozowski's Derivatives Extended to Multiplicities
TCTL Inevitability Analysis of Dense-Time Systems
Pairwise Rational Kernels Obtained by Automaton Operations
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
Significant Subpatterns Matching
Factor Automata of Automata and Applications
A Translation from the HTML DTD into a Regular Hedge Grammar
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable
An Active Learning Algorithm for Bidirectional Deterministic Finite Automata
Semilinearity of Families of Languages
Applications of Symbolic Finite Automata
Decision Problems for Subregular Classes
Languages Recognizable by Quantum Finite Automata
Descriptional Complexity of Power and Positive Closure on Convex Languages
On the Suffix Automaton with Mismatches
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata
Linear-Time Model Checking: Automata Theory in Practice
State Complexity of Prefix Distance
WFSC - A New Weighted Finite State Compiler
Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting
A Fast Suffix Automata Based Algorithm for Exact Online String Matching
Strict Local Testability with Consensus Equals Regularity
On the Disambiguation of Weighted Automata
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers
Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction
Ternary Directed Acyclic Word Graphs
Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits
Using Acceptors as Transducers
The Number of Runs in Sturmian Words
Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024, Proceedings
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata
Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata
Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach
Spiking Neural P Systems Used as Acceptors and Transducers
Implementation and Application of Automata - 26th International Conference, CIAA 2022, Rouen, France, June 28 - July 1, 2022, Proceedings
Regular Geometrical Languages and Tiling the Plane
Implementation and Application of Automata - 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings
Algorithms for Weighted Finite Automata with Failure Transitions
XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof
Term Validation of Distributed Hard Real-Time Applications
Experiments with Deterministic omega-Automata for Formulas of Linear Temporal Logic
A Disambiguation Algorithm for Finite Automata and Functional Transducers
Large-Scale Training of SVMs with Automata Kernels
Hopcroft's Minimization Technique: Queues or Stacks?
Compressed Storage of Sparse Finite-State Transducers
Run-Length Encoded Nondeterministic KMP and Suffix Automata
Star Normal Form, Rational Expressions, and Glushkov WFAs Properties
Hedge Pattern Partial Derivative
On Predictive Parsing and Extended Context-Free Grammars
Cellular Automata on Regular Rooted Trees
The MERLin Environment Applied to *-NFAs
The Power of Regularity-Preserving Multi Bottom-up Tree Transducers
A Simple Method for Building Bimachines from Functional Finite-State Transducers
Toward the Glushkovization of Automata: The Strong Stabilization
Left is Better than Right for Reducing Nondeterminism of NFAs
Recognition of Labeled Multidigraphs by Spanning Tree Automata
Timed and Untimed Energy Games
Synchronizing Random Almost-Group Automata
Bi-directional Automata to Extract Complex Phrases from Texts
Implementation Concepts in Vaucanson 2
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata
FIRE Lite: FAs and REs in C++
Treatment of Unknown Words
On the Conjecture ℒ DFCM ⊊ RCM
Static Garbage Collection
A Class of Rational n -WFSM Auto-intersections
Improving Raster Image Run-Length Encoding Using Data Order
Amount of Nonconstructivity in Finite Automata
On Minimizing Cover Automata for Finite Languages in O(n log n) Time
LANGAGE: A Maple Package for Automaton Characterization of Regular Languages
Finite Automata for Compact Representation of Language Models in NLP
A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule
Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages
Prefix Distance Between Regular Languages
A Package for the Implementation of Block Codes as Finite Automata
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
Automata and Computational Probabilities
Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy
Automata and AB-Categorial Grammars
Cover Languages and Implementations
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism
Investigations on Automata and Languages over a Unary Alphabet
Some Results Concerning Careful Synchronization of Partial Automata and Subset Synchronization of DFA's
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal
Weighted LTL with Discounting
Generalised Twinning Property
COMPAS - A Computing Package for Synchronization
Hardware Implementations of Finite Automata and Regular Expressions - Extended Abstract
Correctness Preservation and Complexity of Simple RL-Automata
FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views
Reachability Games on Automatic Graphs
Trimming Visibly Pushdown Automata
Loops and Overloops for Tree Walking Automata
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
Subset Seed Automaton
Efficient Computation of Throughput Values of Context-Free Languages
A Pushdown Transducer Extension for the OpenFst Library
Time-Optimal Winning Strategies for Poset Games
Derivative-Based Diagnosis of Regular Expression Ambiguity
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract
Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata
INTEX: An Integrated FST Toolbox
Submodule Construction and Supervisory Control: A Generalization
Checking Whether an Automaton Is Monotonic Is NP-complete
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P)
SEA: A Symbolic Environment for Automata Theory
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity
On Comparing Deterministic Finite Automata and the Shuffle of Words
On the Number of Synchronizing Colorings of Digraphs
Syntax Checking Either Way
New Algorithms for Manipulating Sequence BDDs
Kleene Closure on Regular and Prefix-Free Languages
Compiler Generator Based on Restarting Automata
Incremental DFA Minimisation
Parametrizing String Assembling Systems
AVA: An Applet for Visualizing FRACTRAN and Other Automata
The Syntactic Prediction with Token Automata: Application to HandiAS System
State Complexity of Basic Operations on Finite Languages
On Synchronizing Automata and Uniform Distribution
Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms
The Exact Complexity of Star-Complement-Star
Multi-Tilde-Bar Derivatives
Viral Gene Compression: Complexity and Verification
Bit Parallelism - NFA Simulation
Partial Word DFAs
Finite Eilenberg Machines
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems
Searching for Asymptotic Error Repair
Time and Space Efficient Algorithms for Constrained Sequence Alignment
OpenFst: A General and Efficient Weighted Finite-State Transducer Library
Implementation and Application of Automata in String Processing
Regular Expressions on Average and in the Long Run
Constrained Multi-Tildes
Automata-Based Termination Proofs
Bag Automata and Stochastic Retrieval of Biomolecules in Solution
Syntactic Complexity of Bifix-Free Languages
FA Minimisation Heuristics for a Class of Finite Languages
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton
Memory Reduction for Strategies in Infinite Games
Computing the Expected Edit Distance from a String to a PFA
Simulating the Process of Gene Assembly in Ciliates
Restarting Tiling Automata
Deterministic Parsing of Cyclic Strings
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata
On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata
Degrees of Restriction for Two-Dimensional Automata
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
Glushkov Construction for Multiplicities
Graph-Walking Automata: From Whence They Come, and Whither They are Bound
Cellular Automata with Sparse Communication
Lexical Disambiguation with Polarities and Automata
Code Selection by Tree Series Transducers
LALBLC A Program Testing the Equivalence of dpda's
Expressive Capacity of Concatenation Freeness
Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings
Common Subsequence Automaton
Finding Common Motifs with Gaps Using Finite Automata
A Benchmark Production Tool for Regular Expressions
A Uniformization Theorem for Nested Word to Word Transductions
Part-of-Speech Tagging with Two Sequential Transducers
Fast Implementations of Automata Computations
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
Small Extended Expressions for Acyclic Automata
Gaining Power by Input Operations: Finite Automata and Beyond
Two Routes to Automata Minimization and the Ways to Reach It Efficiently
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs
A Type System for Weighted Automata and Rational Expressions
Finite-State Temporal Projection
Algorithms for Guided Tree Automata
Compressing Regular Expressions' DFA Table by Matrix Decomposition
Ordered Context-Free Grammars
Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
Multiflex: A Multilingual Finite-State Tool for Multi-Word Units
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers
On Complexity of Two Dimensional Languages Generated by Transducers
Push Complexity: Optimal Bounds and Unary Inputs
In Search of Most Complex Regular Languages
Experiments with Synchronizing Automata
Extraction of epsilon-Cyclesfrom Finite-State Transducers
Earliest Query Answering for Deterministic Stepwise Hedge Automata
Brute Force Determinization of NFAs by Means of State Covers
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs
Quantum Queries on Permutations with a Promise
Random Generation of Deterministic Acyclic Automata Using Markov Chains
Hyper-optimization for Deterministic Tree Automata
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton
Accelerating Boyer Moore Searches on Binary Texts
Implementation and Application of Automata - 29th International Conference, CIAA 2025, Palermo, Italy, September 22-25, 2025, Proceedings
Better Hyper-minimization - Not as Fast, But Fewer Errors
Weighted Nested Word Automata and Logics over Strong Bimonoids
Practical Optimizations for Automata
The Constrained Longest Common Subsequence Problem for Degenerate Strings
An Efficient Pre-determinization Algorithm
Regex and Extended Regex
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
State Complexity of Catenation Combined with Union and Intersection
p-Subsequentiable Transducers
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata
Approximation to the Smallest Regular Expression for a Given Regular Language
How to Synchronize the Heads of a Multitape Automaton
Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract)
A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems
Concatenation State Machines and Simple Functions
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Experiments with Automata Compression
Nondeterministic State Complexity of Star-Free Languages
Automata Implementation, First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996, Revised Papers
How to Settle the ReDoS Problem: Back to the Classical Automata Theory
A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule
Multi-tape Automata for Speech and Language Systems: A Prolog Implementation
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers
Crystal Lattice Automata
On the State Complexity of Combined Operations
When Is Context-Freeness Distinguishable from Regularity? an Extension of Parikh's Theorem
INTEX 4.1 for Windows: A Walkthrough
Information Distance and Its Applications
Using Finite State Technology in Natural Language Processing of Basque
Finite State Lazy Operations in NLP
Looking for Pairs that Hard to Separate: A Quantum Approach
Analysis of Reactive Systems with n Timers
Sweeping Input-Driven Pushdown Automata
The Degree of Irreversibility in Deterministic Finite Automata
Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings
From Hadamard Expressions to Weighted Rotating Automata and Back
Towards the Algorithmic Molecular Self-assembly of Fractals by Cotranscriptional Folding
Path-Equivalent Removals of epsilon -transitions in a Genomic Weighted Finite Automaton
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs
On Palindromic Sequence Automata and Applications
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
Automata and Grammars for Data Words
Hyper-minimization for Deterministic Tree Automata
An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers
Weighted Variable Automata over Infinite Alphabets
automata, a Hybrid System for Computational Automata Theory
Forgetting Automata and Unary Languages
Global One-Counter Tree Automata
Compact Normal Form for Regular Languages as Xor Automata
Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata
Regular Expressions at Their Best: A Case for Rational Design
Implementing WS1S via Finite Automata: Performance Issues
Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract)
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
Efficient Automaton-Based Recognition for Linear Conjunctive Languages
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata
Extended Sequentialization of Transducers
Automata Implementation, 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, Revised Papers
Block Languages and Their Bitmap Representations
Transduction of Automatic Sequences and Applications
Tiburon: A Weighted Tree Automata Toolkit
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
Jumping Finite Automata: Characterizations and Complexity
On the Software Design of Cellular Automata Simulators for Ecological Modeling
On the Equivalence Problem for Programs with Mode Switching
Computing the Follow Automaton of an Expression
Implementing Computations in Automaton (Semi)groups
Implications of Quantum Automata for Contextuality
On the Hardness of Priority Synthesis
On the Values for Factor Complexity
Concurrency, Synchronization, and Conflicts in Petri Nets
On Straight Words and Minimal Permutators in Finite Transformation Semigroups
Input-Driven Multi-counter Automata
Constructing a BPE Tokenization DFA
Adaptive Rule-Driven Devices - General Formulation and Case Study
Analyzing Ambiguity of Context-Free Grammars
Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata
Synthesizing State-Based Object Systems from LSC Specifications
Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata
On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages
Enumerating Regular Expressions and Their Languages
Guessing the Buffer Bound for k-Synchronizability
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time
Multi-tape Automata with Symbol Classes
Feedback-Free Circuits in the Algebra of Transients
Two-Party Watson-Crick Computations
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs
The Commutative Closure of Shuffle Languages over Group Languages is Regular
Borders and Finite Automata
Incomplete Transition Complexity of Basic Operations on Finite Languages
The Generalization of Generalized Automata: Expression Automata
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
Typed Linear Algebra for Weigthed (Probabilistic) Automata
A Finite-State Super-Chunker
Past Pushdown Timed Automata
Bouma2 - A High-Performance Input-Aware Multiple String-Match Algorithm
WIA and the Practice of Theory in Computer Science
Security of Numerical Sensors in Automata
Implementation of State Elimination Using Heuristics
Counting the Solutions of Presburger Equations without Enumerating Them
Hybrid Extended Finite Automata
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
The Membership Problem for Linear and Regular Permutation Languages
TREEBAG
On Syntactic Complexity of Circular Semi-flower Automata
Adding Pebbles to Weighted Automata
A Formal Framework for Processes Inspired by the Functioning of Living Cells
A Completion Algorithm for Lattice Tree Automata
An Application of Quantum Finite Automata to Interactive Proof Systems
Building Phylogeny with Minimal Absent Words
Size Reduction of Multitape Automata
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
Epsilon Automata on Linear Orderings
Electronic Voting: How Logic Can Help
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton
FPsolve: A Generic Solver for Fixpoint Equations over Semirings
Nondeterministic Complexity of Operations on Free and Convex Languages
Streamable Fragments of Forward XPath
Visualization of Dynamic Automata Using Padnon
Automata for Specifying Component Interfaces
Running Time Complexity of Printing an Acyclic Automaton
Large Aperiodic Semigroups
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
Synchronizing Automata of Bounded Rank
Measuring Power of Commutative Group Languages
Complexity of Proper Suffix-Convex Regular Languages
Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions
MONA Implementation Secrets
Wind in the Willows - Generating Music by Means of Tree Transducers
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory
Z-Automata for Compact and Direct Representation of Unranked Tree Languages
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
Automata with Modulo Counters and Nondeterministic Counter Bounds
Learning Regular Languages Using Nondeterministic Finite Automata
Simulations of Weighted Tree Automata
An Automaton Model of User-Controlled Navigation on the Web
Random Number Generation with +-NFAs
Tree Automata and XPath on Compressed Trees
A Measure for the Degree of Nondeterminism of Context-Free Languages
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems
Computing Convex Hulls by Automata Iteration
From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
On the Number of Active States in Deterministic and Nondeterministic Finite Automata
Counting Equivalent Linear Finite Transducers Using a Canonical Form
Derick Wood: Always in Our Hearts
Multiset Processing by Means of Systems of Finite State Transducers
Computing the Bandwidth of Meager Timed Automata
Unary Languages Recognized by Two-Way One-Counter Automata
Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings
Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata
A Practical Simulation Result for Two-Way Pushdown Automata
Computing Raster Images from Grid Picture Grammars
Kuratowski Algebras Generated by Prefix-Free Languages
Paging Automata
Finding Finite Automata That Certify Termination of String Rewriting
On the Smallest Synchronizing Terms of Finite Tree Automata
The Validity of Weighted Automata
A Polynomial Time Algorithm for Left [Right] Local Testability
Fixpoint Guided Abstraction Refinement for Alternating Automata
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata
Enumeration of Cryptarithms Using Deterministic Finite Automata
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
Automata and Binary Decision Diagrams
Chrobak Normal Form Revisited, with Applications
Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings
Learning Stochastic Finite Automata for Musical Style Recognition
State Complexity and Jacobsthal's Function
Magic Numbers for Symmetric Difference NFAs
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
A Basis for Looping Extensions to Discriminating-Reverse Parsing
Simulation of Soliton Circuits
Non-emptiness Test for Automata over Words Indexed by the Reals and Rationals
Does Hausdorff Dimension Measure Texture Complexity?
Word Random Access Compression
Construction of Efficient Generalized LR Parsers