Characterization of Glushkov automata
From MaRDI portal
Publication:1575946
DOI10.1016/S0304-3975(97)00296-XzbMath0952.68084MaRDI QIDQ1575946
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (30)
Some properties of Ising automata ⋮ How to settle the ReDoS problem: back to the classical automata theory ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ Compact and fast algorithms for safe regular expression search ⋮ Series parallel digraphs with loops ⋮ On the Hierarchy of Block Deterministic Languages ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Constrained multi-tildes ⋮ Smaller representation of compiled regular expressions ⋮ Efficient weighted expressions conversion ⋮ Sampling different kinds of acyclic automata using Markov chains ⋮ A characterization of Thompson digraphs. ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ More Concise Representation of Regular Languages by Automata and Regular Expressions ⋮ Generalizations of 1-deterministic regular languages ⋮ More concise representation of regular languages by automata and regular expressions ⋮ Acyclic networks maximizing the printing complexity ⋮ Derivatives of rational expressions with multiplicity ⋮ Multi-tilde-bar expressions and their automata ⋮ How expressions can code for automata ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ Weak Inclusion for XML Types ⋮ Random Generation of Deterministic Acyclic Automata Using Markov Chains ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Position Automaton Construction for Regular Expressions with Intersection ⋮ Small Extended Expressions for Acyclic Automata ⋮ Automata and rational expressions ⋮ The Bottom-Up Position Tree Automaton and the Father Automaton ⋮ On the hierarchy of generalizations of one-unambiguous regular languages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Local languages and the Berry-Sethi algorithm
- AUTOMATE, a computing package for automata and finite semigroups
- The passing of a rational expression to a nondeterministic finite automaton
- Regular expressions into finite automata
- THE ABSTRACT THEORY OF AUTOMATA
- Programming Techniques: Regular expression search algorithm
This page was built for publication: Characterization of Glushkov automata
