One-unambiguity of regular expressions with numeric occurrence indicators

DOI10.1016/J.IC.2006.12.003zbMATH Open1118.68079OpenAlexW1968420454MaRDI QIDQ2373702FDOQ2373702

Authors: Pekka Kilpeläinen, Rauno Tuhkanen 

Publication date: 16 July 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.12.003

Recommendations

• One-unambiguous regular languages
• Deciding determinism of regular languages
• Generalized one-unambiguity
• Inclusion Test Algorithms for One-Unambiguous Regular Expressions
• One-unambiguous regular languages

zbMATH Keywords

XML schemaregular expressioninterval expressionnumeric iterationone-unambiguityunique particle attribution

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• THE ABSTRACT THEORY OF AUTOMATA
• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• One-unambiguous regular languages
• Web services. Concepts, architectures and applications
• Title not available (Why is that?)
• A logic you can count on
• Regular expressions into finite automata
• Local languages and the Berry-Sethi algorithm
• Online evaluation of regular tree queries
• Mathematical Foundations of Computer Science 2004
• Title not available (Why is that?)
• The validation of SGML content models

Cited In (11)

• Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
• Inclusion Test Algorithms for One-Unambiguous Regular Expressions
• Closure properties and descriptional complexity of deterministic regular expressions
• Regular Expressions with Counting: Weak versus Strong Determinism
• Efficient testing and matching of deterministic regular expressions
• Definability by weakly deterministic regular expressions with counters is decidable
• Checking determinism of regular expressions with counting
• The complexity of SORE-definability problems
• Fast matching of regular patterns with synchronizing counting
• Succinct determinisation of counting automata via sphere construction
• Deciding definability by deterministic regular expressions

Uses Software

• PERL
• Relax NG

This page was built for publication: One-unambiguity of regular expressions with numeric occurrence indicators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373702)