Deterministic regular languages
From MaRDI portal
Publication:5096780
DOI10.1007/3-540-55210-3_182zbMATH Open1493.68184OpenAlexW1582705003MaRDI QIDQ5096780FDOQ5096780
Authors: Anne Brüggemann-Klein, D. Wood 
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_182
Recommendations
Cites Work
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Derivatives of Regular Expressions
- Bracketed context-free languages
- Regular right part grammars and their parsers
- Title not available (Why is that?)
- Regular expressions into finite automata
- From regular expressions to deterministic automata
- Ambiguity in Graphs and Expressions
- Title not available (Why is that?)
Cited In (11)
- One-unambiguous regular languages
- Syntactic structures of regular languages
- One-unambiguous regular languages
- Checking determinism of regular expressions with counting
- Language theoretic properties of regular DAG languages
- An efficient null-free procedure for deciding regular language membership
- Games for active XML revisited
- Local languages and the Berry-Sethi algorithm
- Regular expressions into finite automata
- Generalizations of 1-deterministic regular languages
- Deciding definability by deterministic regular expressions
This page was built for publication: Deterministic regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096780)
