Local languages and the Berry-Sethi algorithm
From MaRDI portal
Publication:672153
DOI10.1016/0304-3975(95)00104-2zbMATH Open0872.68116OpenAlexW2090901599MaRDI QIDQ672153FDOQ672153
Authors: Jean Berstel, Jean-Éric Pin 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00104-2
Recommendations
- scientific article; zbMATH DE number 2040915
- Locally finite languages
- On locally reversible languages
- Local periods and binary partial words: an algorithm
- A characterization of local regular languages
- Lattices of local two-dimensional languages
- Local search in coding theory
- Local decodability of the Burrows-Wheeler transform
- On Languages Reducible to Algorithmically Random Languages
- Locality and the complexity of minimalist derivation tree languages
Cites Work
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Title not available (Why is that?)
- The passing of a rational expression to a nondeterministic finite automaton
- From regular expressions to deterministic automata
- Transductions des langages de Chomsky
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Deterministic regular languages
Cited In (20)
- Infinite Arrays and Domino Systems
- Characterization of Glushkov automata
- Traces of Control-Flow Graphs
- One-unambiguous regular languages
- Shuffle on positive varieties of languages
- Efficient recognition of trace languages defined by repeat-until loops
- How expressions can code for automata
- Families of locally testable languages
- A deterministic parsing algorithm for ambiguous regular expressions
- One-unambiguous regular languages
- Two-Sided Strictly Locally Testable Languages
- One-unambiguity of regular expressions with numeric occurrence indicators
- From regular expressions to finite automata∗
- From regular expressions to smaller NFAs
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- Language operations with regular expressions of polynomial size
- Title not available (Why is that?)
- Automata and rational expressions
- From regular to strictly locally testable languages
- From ambiguous regular expressions to deterministic parsing automata
This page was built for publication: Local languages and the Berry-Sethi algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672153)
