Subset construction complexity for homogeneous automata, position automata and ZPC-structures

DOI10.1016/S0304-3975(00)00293-0zbMath0984.68102MaRDI QIDQ5958722

Jean-Marc Champarnaud

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

homogeneous automatonposition automatonposition setssubset constructionZPC-structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA ⋮ BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS ⋮ FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON

Uses Software

• AUTOMATE
• Grail

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• AUTOMATE, a computing package for automata and finite semigroups
• The passing of a rational expression to a nondeterministic finite automaton
• \textit{Grail}: A C++ library for automata and expressions
• An efficient null-free procedure for deciding regular language membership
• On the computational power of pushdown automata
• Automata Studies. (AM-34)
• THE ABSTRACT THEORY OF AUTOMATA

This page was built for publication: Subset construction complexity for homogeneous automata, position automata and ZPC-structures