Macarie, Ioan I.
Overview
Works:  8 works in 15 publications in 1 language and 38 library holdings 

Roles:  Author 
Publication Timeline
.
Most widely held works by
Ioan I Macarie
Closure properties of stochastic languages by I Macarie(
Book
)
1 edition published in 1993 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 6 WorldCat member libraries worldwide
Properties of probabilistic pushdown automata by Ioan I Macarie(
Book
)
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Properties of probabilistic as well as 'probabilistic plus nondeterministic' pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of wellknown complexity classes are given for the classes of languages recognized by polynomial timebounded, logarithmic spacebounded auxiliary pushdown automata with probabilistic states and with 'probabilistic plus nondeterministic' states. Also, complexity lower bounds are given for the classes of languages recognized by these automata with unlimited running time. It follows that, by fixing an appropriate mode of computation, the difference between classes of languages such as P and PSPACE, NL and SAC¹, PL and Diff[subscript>](#SAC¹) is characterized as the difference between the number of stack symbols; that is, whether the stack alphabet contains one versus two distinct symbols."
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Properties of probabilistic as well as 'probabilistic plus nondeterministic' pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of wellknown complexity classes are given for the classes of languages recognized by polynomial timebounded, logarithmic spacebounded auxiliary pushdown automata with probabilistic states and with 'probabilistic plus nondeterministic' states. Also, complexity lower bounds are given for the classes of languages recognized by these automata with unlimited running time. It follows that, by fixing an appropriate mode of computation, the difference between classes of languages such as P and PSPACE, NL and SAC¹, PL and Diff[subscript>](#SAC¹) is characterized as the difference between the number of stack symbols; that is, whether the stack alphabet contains one versus two distinct symbols."
Spaceefficient deterministic simulation of probabilistic automata by Ioan I Macarie(
Book
)
2 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
Connections among spacebounded and multihead probabilistic automata by Ioan I Macarie(
Book
)
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Properties of multihead twoway probabilistic finite automata by Ioan I Macarie(
Book
)
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
On the structure of logspace probabilistic complexity classes by Ioan I Macarie(
Book
)
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We investigate hiearchical properties and logspace reductions of languages recognized by logspace probabilistic Turing machines, ArthurMerlin games and Games against Nature with logspace probabilistic verifiers. For each logspace complexity class, we decompose it into a hierarchy based on corresponding multihead twoway finite automata and we (eventually) prove the separation of the hierarchy levels (even over one letter alphabet); furthermore, we show logspace reductions of each logspace complexity class to low levels of its corresponding hierarchy. We find probabilistic (and 'probabilistic+nondeterministic') variants of Savitch's maze threading problem which are logspace complete for PL (and respectively P) and can be recognized by twohead and oneway onecounter finite automata with probabilistic (probabilistic and nondeterministic) states."
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We investigate hiearchical properties and logspace reductions of languages recognized by logspace probabilistic Turing machines, ArthurMerlin games and Games against Nature with logspace probabilistic verifiers. For each logspace complexity class, we decompose it into a hierarchy based on corresponding multihead twoway finite automata and we (eventually) prove the separation of the hierarchy levels (even over one letter alphabet); furthermore, we show logspace reductions of each logspace complexity class to low levels of its corresponding hierarchy. We find probabilistic (and 'probabilistic+nondeterministic') variants of Savitch's maze threading problem which are logspace complete for PL (and respectively P) and can be recognized by twohead and oneway onecounter finite automata with probabilistic (probabilistic and nondeterministic) states."
Decreasing the bandwidth of a transition matrix by Ioan I Macarie(
Book
)
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Adapting the competitions method of Freivalds to the setting of unboundederror probabilistic computation, we prove that, for any [epsilon] [member of] (0,1], BandMatInv(n[superscript [epsilon]]) is logspace complete for the class of languages recognized by logspace unboundederror probabilistic Turing machines (PL). This extends the result of Jung that BandMatInv(n) is logspace complete for PL, and may open new possibilities for spaceefficient deterministic simulation of spacebounded probabilistic Turing machines."
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Adapting the competitions method of Freivalds to the setting of unboundederror probabilistic computation, we prove that, for any [epsilon] [member of] (0,1], BandMatInv(n[superscript [epsilon]]) is logspace complete for the class of languages recognized by logspace unboundederror probabilistic Turing machines (PL). This extends the result of Jung that BandMatInv(n) is logspace complete for PL, and may open new possibilities for spaceefficient deterministic simulation of spacebounded probabilistic Turing machines."
Bits and relative order from residues, space efficiently by
Paul Frederick Dietz(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Languages