Automata for Deterministic Context-Free Iterations
One-variable context-free hedge automata
... of bottom-up computations) and also horizontal navigation between children, since their number is unbounded. The original HA is an hybrid model where horizontal and vertical navigation rules are not specified in the same ...
31
Push-down Automata and Context-free Grammars
... push-down automata (PDA) for vari- ous languages, the conversion of CFGs to PDAs, and vice ...push-down automata in Section ...for context-free grammars called the Chomsky normal ...
26
Width of Non-deterministic Automata
... in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any accepted ...coBüchi automata ...
15
PP 2016 38: Constructing Semantic Automata for Quantifier Iterations
... and context-free languages under quantifier iteration via arguments from regular expressions and context-free grammars, ...and context-free languages under substitution; however, ...
16
A linear time extension of deterministic pushdown automata
... the context-free languages and at least one language that is not context-free, namely {a n b n c n | n ≥ 0}, it follows that they strictly include the context-free ...
8
Active Coevolutionary Learning of Deterministic Finite Automata
... One advantage of the EEA over the EDSM methods is that it allows for both compression and expansion of models: EDSM methods only allow for compression at each step, and do not allow re-expansion. The advantage of this is ...
28
Intuitionistic Fuzzy Pushdown Automata and Intuitionistic Fuzzy Context-Free Languages
... pushdown automata and ...Fuzzy Context Free Language with empty stack has an equivalent intuitionistic Fuzzy PDA that accepts the same language with final state and ...fuzzy ...
11
Context-free ambiguity detection using multi-stack pushdown automata
... multi-pushdown automata called bounded-balance multi-stack pushdown ...the context of language intersection, limiting the balances in a run has several advantages over limiting the number of contexts or ...
12
Grammatical Induction with Error Correction for Deterministic Context-free L-systems
... Here we address grammatical induction with error correc- tion for deterministic context-free L(D0L)-system. That is, the paper proposes a method of L-system grammar induction from a transmuted string ...
5
Learning Subregular Classes of Languages with Factored Deterministic Automata
... Factored grammars in which each factor recog- nizes Σ ∗ , as in the case of Figure 1, are of par- ticular interest. Every sub-Star-Free class of lan- guages in which the parameters of the class (k, for example) ...
8
A Practical Algorithm for Intersecting Weighted Context free Grammars with Finite State Automata
... 3.2 Intersecting LR(0) Automata with Finite-state Automata Algorithm 2 computes the intersection of M and A. The algorithm maintains a breadth-first queue L of state pairs ∈ Q M × Q A . In line 4, a pair ...
8
Kullback Leibler Distance between Probabilistic Context Free Grammars and Probabilistic Finite Automata
... finite automata (FAs), are not able to describe hierarchical, tree-shaped struc- ture, and thereby seem less suitable than CFGs for full analysis of syntactic ...full context-free processing could be ...
7
A deterministic model of the free will phenomenon
... indeterministic free will, we look for experimental tests that can distinguish an automaton from an agent that has free will in the abstract ...complicated automata. In all cases they follow the laws ...
20
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
... a context-free language defined over a one-letter alphabet is ...unary context-free grammars and unary pushdown automata can be transformed into equivalent finite ...and ...
22
Deterministic Finite Automata. Non deterministic finite automata. Non-Deterministic Finite Automata (NFA) Non-Deterministic Finite Automata (NFA)
... • Non-deterministic finite automata (NFA) – Machine now can “choose” it’s path.. – Each transition takes you from a state to a set of states.[r] ...
Non-Deterministic Automata
... Note. Please note that while there may be several possible sequences of states, at any given moment of time, we can be in only one state: we cannot jump to two different states at the same time. Simple examples. Let us ...
Investigations of Mealy automata growth at iterations
... of automata coincide, that is the equality [γ A 1 ] = [γ A 2 ] ...similar automata have the same growth functions, and therefore pairwise non-similar automata can be selected as representatives of ...
28
Deterministic Finite Automata (DFAs)
... Finally, since we know that x ends in cd, regardless of where in the triangle w leaves us (even if w = Λ), cd carries us to the accept state.... x has no other occurrence of cd.[r] ...
51
Collaboration Entities on Deterministic Finite Automata
... n We model the entities in a collaboration session to be finite automaton-based, and point out that they are deterministic finite automata in essence. n We describe the characteristics of the ...
12
Collaboration Entities on Deterministic Finite Automata
... ABSTRACT We have developed several types of collaborative applications. They are realizations of the Shared Event Model in Grid-base Collaboration, and examples of Peer- to-Peer Grid computing. Each application type ...
12