Deterministic regular languages

DOI10.1007/3-540-55210-3_182MaRDI QIDQ5096780zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• One-unambiguous regular languages
• Deterministic regular expressions with back-references
• The validation of SGML content models
• One-unambiguous regular languages
• Deterministic regular expressions with back-references

Cites work

• Ambiguity in Graphs and Expressions
• Bracketed context-free languages
• Derivatives of Regular Expressions
• From regular expressions to deterministic automata
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1951550 (Why is no real title available?)
• scientific article; zbMATH DE number 3298851 (Why is no real title available?)
• Regular expressions into finite automata
• Regular right part grammars and their parsers
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(12)

• Regular expressions into finite automata
• The validation of SGML content models
• An efficient null-free procedure for deciding regular language membership
• Language theoretic properties of regular DAG languages
• Syntactic structures of regular languages
• Checking determinism of regular expressions with counting
• Deciding definability by deterministic regular expressions
• Games for active XML revisited
• One-unambiguous regular languages
• One-unambiguous regular languages
• Local languages and the Berry-Sethi algorithm
• Generalizations of 1-deterministic regular languages

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)