On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata (Q3698326)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
scientific article

    Statements

    On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    finite automata
    0 references
    finite state transducers
    0 references
    ambiguous automata
    0 references
    equivalence problem
    0 references
    containment problem
    0 references
    nondeterministic finite automaton
    0 references
    accepting state transition sequence
    0 references
    degree of ambiguity
    0 references
    homogeneous linear difference equations
    0 references
    regular expressions
    0 references
    regular grammars
    0 references
    0 references