Results 1 
6 of
6
GROUPS WITH CONTEXTFREE COWORD PROBLEM AND EMBEDDINGS INTO THOMPSON’S GROUP V
"... Abstract. We describe a generalized Thompson group V(G,θ) for each finite group G with homomorphism θ: G → G. Our group is constructed using the cloning map concept introduced by Witzel and Zaremsky. We prove that V(G,θ) is coCF for any homomorphism θ and finite group G by constructing a pushdown au ..."
Abstract
 Add to MetaCart
Abstract. We describe a generalized Thompson group V(G,θ) for each finite group G with homomorphism θ: G → G. Our group is constructed using the cloning map concept introduced by Witzel and Zaremsky. We prove that V(G,θ) is coCF for any homomorphism θ and finite group G by constructing a pushdown
Left Relations
, 2015
"... Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to nondeterministic finite automata (NFA) based on the Thompson εNFA (AT). The AT automaton has two quotients considered: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating εtransitions ..."
Abstract
 Add to MetaCart
Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to nondeterministic finite automata (NFA) based on the Thompson εNFA (AT). The AT automaton has two quotients considered: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating ε
Modeling and Visualization of Biological Structures
 In Proceeding of Graphics Interface
, 1993
"... Rapid progress in the modeling of biological structures and simulation of their development has occurred over the last few years. It has been coupled with the visualization of simulation results, which has lead to a better understanding of morphogenesis and given rise to new procedural techniques fo ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
, cellular automaton, Lsystem. How far mathematics will suffice to describe, and physics to explain, the fabric of the body, no man can forsee. D'Arcy Thompson, On Growth and Form [40]
Departamento de Ciência de Computadores
, 2014
"... This paper gives a new presentation of Kozen’s proof of Kleene algebra completeness featured in his article A completeness theorem for Kleene algebras and the algebra of regular events. A few new variants are introduced, shortening the proof. Specifically, we directly construct an εfree automaton t ..."
Abstract
 Add to MetaCart
This paper gives a new presentation of Kozen’s proof of Kleene algebra completeness featured in his article A completeness theorem for Kleene algebras and the algebra of regular events. A few new variants are introduced, shortening the proof. Specifically, we directly construct an εfree automaton
Regular expression matching and operational semantics
"... Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be ..."
Abstract
 Add to MetaCart
Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can
Regular Expression Matching and Operational Semantics
"... Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be ..."
Abstract
 Add to MetaCart
Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can