Multi-tilde-bar expressions and their automata

DOI10.1007/s00236-012-0167-xzbMath1279.68138OpenAlexW2106909164WikidataQ60691921 ScholiaQ60691921MaRDI QIDQ715057

Pascal Caron, Ludovic Mignot, Jean-Marc Champarnaud

Publication date: 15 October 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-012-0167-x

zbMATH Keywords

extended expressionsGlushkov automatamulti-tilde-bar expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Constrained multi-tildes ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ Operads, quasiorders, and regular languages

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Complexity measures for regular expressions
• Follow automata.
• Characterization of Glushkov automata
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Acyclic automata and small expressions using multi-tilde-bar operators
• THE ABSTRACT THEORY OF AUTOMATA
• A New Family of Regular Operators Fitting with the Position Automaton Computation
• Multi-tilde Operators and Their Glushkov Automata
• Compact and fast algorithms for safe regular expression search
• From regular expressions to finite automata^∗
• Mathematical Foundations of Computer Science 2004
• Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
• Derivatives of Regular Expressions
• Boolean Matrices and the Stability of Neural Nets

This page was built for publication: Multi-tilde-bar expressions and their automata